基于蚁群优化的置换流水车间调度算法

一篇论文。 摘要：针对置换流水车间调度问题, 提出了一种基于蚁群优化的调度算法。该算法的要点是将NEH 启发式算法和蚁群优化结合起来：首先,将蚁群优化中的能见度定义为NEH 中所用的工作加工时间之和。其次,对于部分解采用了 NEH 中的步骤2 和步骤3 进行局部调整。最后,对构造出的解做插入型局部搜索。用所提算法对置换流水车间调度问题的基准问题进行了测试, 测试结果表明提出算法的有效性。
1692· 1. 70 GHz 504M, WindOwsXp 3 VC++6.0 1a=10 ρ=0.1,q=1.0,B=4.0, 1 Car NEH 7038 7038 7038 C 7166 7166 C ar3 54546978 7376 7312 7399 7312 C ar4 8003 8129 800B 7720 8016 7720 8505 8773 8505 C ar7 6590 6590 6590 C ar8 8 8366 8564 8366 10 NEH ORLIB 100 n Taillard m51020 n2050100 Taillard 5 2 ACs m/n SA GA 5/20 0.04 1.19 1.27 1.61 5/50 0.007 0.43 0.78 5/100 0.04 0.5 0.23 10/20 0.17 1.70 1.71 10/50 1.0l 53 1.89 2.28 10/100 0.57 182 1.22 197 1.33 20/20 0.08 14 1.60 16 0.86 20/50 2.71 2.86 3.44 3 Daya M B, Faw san M A. A tabu search approach for the flow A CS shop s cheduling problem[ J]. Europ ean Jour nal of Op erat ional Resear ch,1996,91:160-175 [4 Low C, Yeh JY, et al. A rob ust simul at ed ann ea ling heurist ic for flow shop sch edulin g problems[ J]. Internat ional Journal of a dvanced Manuf ac tur ing Technology, 2004, 13: 762767 [5 Y ing Kuochin g, Liao Chingjong. An ant colony s ystem for per NEH mutation flow- shop sequ enci g[ J]. Comp uters Op er ation- se arch,2004,31:79H801 Car I 6 Colorni A, Doigo M. Heurist ics from natu re for hard com binato- Taillard rial optim izat ion p rob lem s[ J]. Inter national Trans Op erational Resear ch, 1996(3):121. [7] M acro D. T homas st zle an t colony opt imizat ion[ J]. Cam- 1 Garey E L, John son D S, Sethi R. The complexity of flow- shop brid ge: MIT Press, 2003 i 8 Naw az M, Enscore E, H am I. a heurist ic al gorithm for the nt and jobshop sch eduling[ J]. Mathe matics of Operat ions Re- mach ine A job flow shop se qu encing problem[ J]. Omega, 1983 sear ch,1976(1):117129 1:1195 ◎19 2012chinaAcademicJournalElectronicPublishingR03:b,Allrightsreservedhttp:/www.cnki.net 2004,38:10311034