期刊文献+

基于演化策略算法的置换流水车间调度优化研究 被引量:1

ON PERMUTATION FLOW-SHOP SCHEDULING OPTIMISATION BASED ON EVOLUTIONARY STRATEGY ALGORITHM
下载PDF
导出
摘要 采用演化策略算法求解置换流水车间调度问题,提出了一种基于工件次序的二维实数编码方法。设计了一种基于父代个体两点交叉互换的重组算子来生成子代个体,针对个体编码,采用局部基因随机重新生成的变异算子。计算结果说明,演化策略算法能够有效地对置换流水车间调度问题进行优化,其优化性能好于遗传算法和NEH启发式算法以及粒子群算法。 Evolutionary strategy algorithm is employed to resolve permutation flow-shop scheduling problem,and a two-dimension encoding approach based on job sequence is introduced as well.A kind of recombination operator based on two-point crossover and interchange in the parents is used to generate offspring individuals.In light to individual encoding,a kind of mutation operator is designed that some gene in the encoding is stochastically generated.Computation results show that evolutionary strategy algorithm can effectively optimise the permutation flow-shop scheduling problem and has better performance than genetic algorithm,NEH heuristic algorithm and particle swarm optimisation algorithm.
作者 刘志雄
出处 《计算机应用与软件》 CSCD 2010年第11期35-36,71,共3页 Computer Applications and Software
基金 国家自然科学基金(70801047) 中国博士后科研基金项目(20090450769)
关键词 演化策略算法 置换流水车间 调度 重组 变异 Evolutionary strategy algorithm Permutation flow-shop Scheduling Recombination Mutation
  • 相关文献

参考文献8

二级参考文献27

  • 1徐宗本,李国.解全局优化问题的仿生类算法(I)—模拟进化算法[J].运筹学杂志,1995,14(2):1-13. 被引量:39
  • 2高海兵,周驰,高亮.广义粒子群优化模型[J].计算机学报,2005,28(12):1980-1987. 被引量:102
  • 3 Baeck T.Evolutionary algorithms intheory and practice[M].Pi scataway,NJ:IEEE Press,1995.
  • 4 Yao X,Liu Y.Fast evolutionary programming[A].L.J.Fogel,ed. Proceedings ofthe Fifth Annual Conference on Evoltionary Programming[C].Cam bridge:MITPress,1996,441~450.
  • 5 Yao X,Liu Y.Fast evolutionary strategies[A].P.J.Angeline,e d.Proceedingsof the Sixth Annual Conference on Evolutionary Programming[C].Berlin:Springer,1997,151~161.
  • 6 Gehlhaar D K,F ogel D B.Two new mutation operators for enhanced search andoptimization in evol utionary programming[A].B.Biosacchi,J.Bezdek andD.B.Fogel,eds.Proceedings o f SPIE[C].Piscataway,NJ:IEEE Press,1996,3165:260~269.
  • 7 Beyer G H,Fogel D B.A note on the escape probabilities for two a lternativemethods of selection under gaussian mutation[A].P.J.Angeline,ed.P roceedings of theSixth Annual Conference on Evolutionary Programming[C].Ber lin:Springer,1997,265~274.
  • 8 Eicker F.Sums if independent squard Cauchy variables grow quadratically:Applications[J].Sankhya A,1985,47(3f):678~691.
  • 9 Feller W.An introduction to probability theory and its Applic ations,vol.2[M].NewYork:John Wiley & Sons Inc,1971.
  • 10Nowicki E,Smutnicki C.A fast tabu search algorithm for the permutation flow-shop problem[J].European Journal of Operational Research,1996,91:160-175.

共引文献341

同被引文献11

  • 1王凌.车间调度及其遗传算法[M]北京:清华大学出版社,2003.
  • 2Wang L,Zheng D Z. An effective hybrid optimization strategy for job-shop scheduling problems[J].Computers & Operations Research,2001.585-596.
  • 3Goncalves J F,Mendes J J M,Resende M G C. A hybrid genetie algorithm for the job scheduling problem[J].European Journal of Operational Research,2005.77-95.
  • 4Liu H B,Abraham A,Choi O. Variable neighborhood particle swarm optimization for multi-objective flexible jobshop scheduling problems[J].LNCS,2006.197-204.
  • 5Xia W J,Wu Z M. A hybrid particle swarm optimization approach for the job-shop scheduling problem[J].Intermational Journal of Advanced Manufacturing Technology,2006.360-366.
  • 6Xia W J,Wu Z M. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems[J].COMPUTERS & INDUSTRIAL ENGINEERING,2005.409-425.
  • 7Blum C,Sampels M. An ant colony optimization algorithm for shop scheduling problems[J].J Mathematical Modelling and Algorithms,2004.285-308.
  • 8王凌;刘波.微粒群优化与调度算法[M]北京:清华大学出版社,2008.
  • 9周鹏.求解置换流水车间调度问题的混合蚁群算法[J].计算机工程与应用,2009,45(17):191-193. 被引量:6
  • 10刘延风,刘三阳.改进微粒群优化求解置换流水车间调度问题[J].计算机集成制造系统,2009,15(10):1968-1972. 被引量:13

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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