期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

多构造蚁群优化求解置换流水车间调度问题 被引量：5

Multi-construction Ant Colony Optimization Algorithm for Permutation Flow Shop Scheduling
下载PDF
导出
摘要 针对置换流水车间调度问题,提出了一种多构造蚁群优化求解算法。在该算法中,蚁群采用两种方式构造解,分别是基于NEH(Nawaz-Enscore-Ham,NEH)启发式算法和Rajendran启发式算法,并根据解的质量,自适应地调整两种构造方式在蚁群中所占的比例。对置换流水车间调度问题的基准问题测试表明,提出的算法是有效的。 A Multi Construction Ant Colony Optimization Algorithm for Permutation Flow Shop Scheduling was proposed. In this algorithm, solutions are constructed through two modes,which are based on Nawaz-Enseore-Ham heuristics and Rajendran heuristics respectively. Then the proportion of construction modes is adjusted adaptively according to quality of solution constructed. Simulation results and comparisons based on benchmarks demonstrate the effectiveness of the algorithm.
作者 刘延风 刘三阳
机构地区 西安电子科技大学应用数学系
出处 《计算机科学》 CSCD 北大核心 2010年第1期222-224,共3页 Computer Science
关键词 多构造蚁群优化 置换流水车间调度 NEH启发式算法 Rajendran启发式算法 Permutation flow shop scheduling, Multi construction ant colony optimization, NEH heuristics, Rajendran heuristics
分类号 TP38 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献14

  • 1Garey E L,Johnson D S, Sethi R. The complexity of flow-shop and job-shop scheduling[J]. Mathematics of Operations Research, 1976,1 : 117-129.
  • 2王自强,冯博琴.车间流程的免疫调度算法[J].西安交通大学学报,2004,38(10):1031-1034. 被引量：8
  • 3Daya M B, Fawsan M A. A tabu search approach for the flow shop scheduling problem[J]. European Journal of Operational Research, 1996,91 :160-175.
  • 4Low C, Yeh J Y, et al. A robust simulated annealing heuristic for flow shop scheduling problems[J]. International Journal of Advanced Manufacturing Technology, 2004,13 : 762-767.
  • 5Ying Kuo-Ching, Liao Ching-Jong. An ant colony system for permutation flow-shop sequencing[J].Computers & Operation Research, 2004,31 : 791-801.
  • 6郝晋,石立宝,周家启,徐国禹.基于蚁群优化算法的机组最优投入[J].电网技术,2002,26(11):26-31. 被引量：36
  • 7Colorni A,Doigo M. Heuristics from nature for hard combinatorial optimization problems[J]. International Trans Operational Research, 1996,3 : 1-21.
  • 8Dorigo M, Stutzle T. Ant Colony Optimization[M]. Cambridge: MIT Press, 2003.
  • 9王凌.车问调度及其遗传算法[M].北京:清华大学出版社,2003:1-5.
  • 10Nawaz M, Enseore E, Ham I. A heuristic algorithm for the mmachine n job flow shop sequencing problem[J].Omega, 1983, 11:11-95.

二级参考文献21

  • 1[1]李文沅(Li Wenyuan).电力系统安全经济运行-模型与方法(Secure and economic operation of electrical power system - Model and method)[M].重庆大学出版社(The University of Chongqing Press),1989,3.
  • 2[3]Ruzic S,Rajakovic N,A new approach for solving extended unit commitproblem[J].IEEE Transactions on Power System,1991,6(1).
  • 3[5]Cheng C P,Liu C W,Liu C C.Unit commitment by lagrangian relaxation and genetic algorithm[J].IEEE Transactions on Power System,1995,15(2).
  • 4[7]Ouyang Z,Shahidehpour S M.A multi-stage intellegent system for unit commitment[J].IEEE Transactions on Power Systems,1992,7(2).
  • 5[8]Zhuang F,Galiana F D.Unit commitment by simulated annea-ling[J].IEEE Transactions on Power Systems,1990,5(1).
  • 6[9]Dorigo M,Maniezzo V,Colorni A.Ant system optimization by a colony of cooperating agents[J].IEEE Transactions on System, Man and Cybernetics-Part B:Cybernetics,1996,26(1):29-41.
  • 7[10]Yu I K,Chou C S,Song Y H.Application of the ant colony search algorithm to short-term generation scheduling problem of thermal units[C].Power System Technology Proceedings.1998,552-557.
  • 8[11]Wang S J,Shabidehpour S M,Kirchen D S.Short-term generation scheduling with transmission and environmental constrains using an augmented lagrangian relaxation[J],IEEE Transactions on Power System,1995,10(3).
  • 9[12]Wood A J,Wollenberg B F.Power system operation and control[M].Power Technologies,Inc.Schenectady,New York 1984.
  • 10[13]Ayoub A K,Patton A D.Optimal thermal generating unit commit-ment[J],IEEE Transactions on Power Apparatus and System,1970,PAS-89(2).

共引文献71

同被引文献57

引证文献5

二级引证文献53

计算机科学
2010年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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