期刊文献+

混流车间调度问题的多对染色体遗传算法求解 被引量:3

Multi-pairs of Chromosomes Genetic Algorithm for Hybrid Flow Shop Scheduling
下载PDF
导出
摘要 混流车间调度问题有很强的工程背景,一直是调度领域的研究热点。针对简单遗传算法在求解混流车间调度问题时存在的早熟收敛和易陷入局部极值点的现象,提出了多对染色体遗传算法。多对染色体提供了保留低适应度个体中的有用的染色体的功能,这一染色体构成最优解的部分染色体,以增强算法的搜索能力,提高搜索精度;连锁互换交叉算子可以增加个体的多样性,扩展解的搜索空间,进而增强算法的抗早熟能力。仿真实验表明,多对染色体遗传算法比简单遗传算法提高了全局收敛性能,是解决混流车间调度问题的有效方法。 Hybrid Flow Shop Scheduling Problem is very common in industry, and it is a hotspot in the study of scheduling problems. Genetic algorithm has been applied to HFSP, and it bears the common defect of premature convergence. A novel multi - pairs of chromosomes genetic algorithm (MCGA) is proposed. Because a certain chromosome of an individual with lower fitness to form one chromosome of the optimal solution is reserved, the search capability of MCGA is enhanced. Furthermore, a chain and interchange crossover improves the diversity of the population and avoids the prematurity of the population. The result of simulation test illustrates that MCGA compared with SGA improves the performance of global convergence, so it is an effective method for HFSP.
出处 《计算机仿真》 CSCD 2006年第2期157-160,共4页 Computer Simulation
基金 教育部高校骨干教师资助项目(0X104110)
关键词 混流车间调度问题 遗传算法 多对染色体 HFSP Genetic algorithm Multi - pairs of chromosomes
  • 相关文献

参考文献5

二级参考文献20

  • 1马兆青,袁曾任.基于栅格方法的移动机器人实时导航和避障[J].机器人,1996,18(6):344-348. 被引量:91
  • 2Guinet A. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time.International Journal of Production Research, 1996,34 : 1643-- 1654. 被引量:1
  • 3Hunsucker J L, Shah J R. Comparative performance analysis of priority rules in a constrained flowshop with multiple processor environment . European Journal of Operational Research, 1994, 72:102 --104. 被引量:1
  • 4Brah S A, Hunsucker J L. Branch and bound algorithm for the flowshop with multiprocessors. European Journal of Operational Research, 1991,51 : 88--89. 被引量:1
  • 5Negenman E G. Local search algorithms for the multiprocessor flowshop scheduling problem. Euro-pean Journal of Operational Research, 2001,128 : 147 --158. 被引量:1
  • 6Nowicki E, Smutnicki C. A fast Tabu search algorithm for the permuation flowshop problem[J]. European Journal of Operational Research, 1996, 91:160--175. 被引量:1
  • 7Ben-Daya M, AI-Fawzan M. A tabu search approach for the flowshop scheduling problem[J]. European Journal of Operational Research, 1998,109 : 88-- 95. 被引量:1
  • 8Santos D L, Hunsucker J L, Deal D E. Global lower bounds for flowshops with multiple processors[J].European Journal of Operational Research, 1995,80:112--120. 被引量:1
  • 9Dannenbring D. An evaluation of flowshop sequencing heuristics . Management Science, 1977,23 : 1174 --1182. 被引量:1
  • 10Keron Y, Borenstein J. Potential field methods and their inherent limitations for mobile robot navigation [A]. Proceedings of the International Conference on Robotics and Automation [C]. California,1991.1398-1404. 被引量:1

共引文献91

同被引文献25

  • 1杨殿生.求解装箱问题的一种变长度染色体遗传算法[J].长春工程学院学报(自然科学版),2004,5(2):53-55. 被引量:1
  • 2秦绪伟,范玉顺,尹朝万.集成整车物流系统的网络规划问题研究[J].控制与决策,2006,21(2):129-134. 被引量:3
  • 3马士华,张晓龙.基于物流能力约束的整车物流计划[J].工业工程与管理,2006,11(6):15-18. 被引量:6
  • 4Akyol D E, Bayhan G M. A Review on Evolution of Production Scheduling with Neural Networks[J]. Computers and Industrial Engineering, 2007, 53(1): 95-122. 被引量:1
  • 5Li Maojun, Tong Tiaosheng, Luo Longfu. Partheno-genetic Algorithm and Its Application[J]. Journal of Hunan University, 1998, 25(6): 56-59. 被引量:1
  • 6GAREY E L, JOHNSON D S, SETHI R. The complexity of flow shop and Job Shop seheduling[J]. Mathematics Opera tions Research, 19 9 6,1 (2) : 117-119. 被引量:1
  • 7WANG L, ZHENG D Z. A modified genetic algorithm for Job Shop scheduling[J]. The International Journal of Advanced Manufacturing Technology, 2002,20 ( 1 ) : 72-76. 被引量:1
  • 8CHAN F T S, WONG T C, CHAN L Y. Lot streaming for product assembly in Job Shop environment[J]. Robotics and Computer_Integrated Manufacturing,2008,24(3) :321-331. 被引量:1
  • 9PONGCHAROEN P, HICKS C, BRAIDEN P M, et al. Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products[J]. International Journal of Production Economies, 2002, 78 (3) : 311 -322. 被引量:1
  • 10YASSINE A A, MEIER C, BROWNING T R. Multi-project scheduling using competent genetic algorithmsI-R/OL3. [2007- 02-01]. http://www, iese. illinois, edu/pdlab/Papers/GA- Scheduling. pdf. 被引量:1

引证文献3

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部