基于蚁群优化算法的批调度问题分析-analysis of batch scheduling problem based on ant colony optimization algorithm.docxVIP

基于蚁群优化算法的批调度问题分析-analysis of batch scheduling problem based on ant colony optimization algorithm.docx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
ABSTRACTBatch processing machine (BPM) is one of very important model production scheduling problems. Theoretically, it is a breakthrough and an extension of classic scheduling theory. The BPM problem ignores the restriction on the number of jobs that can be processed on a machine simultaneously, which shows a new research direction in production scheduling. BPM, extracted from the last phrase of semi-conductor production, is a new kind of scheduling problem and has a very strong background in application. Meanwhile, BPM is NP-hard which shows that it is very important to design a simple and effective algorithm for solving the problem.Ant colony optimization (ACO) proposed recently is an effective meta-heuristic algorithm in solving combinatorial optimization problems. It is a constructive based meta-heuristic, which means a complete solution was constructed by adding solution part into it. Therefore, the ACO algorithm is suitable to solve BPM because of its characteristic in batching. In addition, the ACO algorithm is population-based meta-heuristic which has memory storage capacity. The combination of these characteristics makes the ACO algorithm as a very unique meta-heuristic for solving the BPM problem. However, ACO has some shortcomings in long run time and easily trapped in local optimal in practice. Therefore, base on the structure analysis of the BPM problem, several improving scheme was proposed to promote the quality and efficiency of ACO in solving BPM.The research focuses on the development of efficient algorithms for solving BPM problem. Ant system algorithms for solving different types of BPM problems were proposed. Specifically, the main research and innovations include:The application of algorithm ant system (AS) was studied in the single batch processing machine with non-identical job sizes. First, the mathematic model of the problem was proposed. Lower bounds and heuristics of the problem already existed were also presented. Two ant system

您可能关注的文档

文档评论(0)

xyz118 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档