期刊文献+

具有滚动优化特性的改进型蚁群算法及其在提前/拖期Job Shop问题中的应用 被引量:1

Application of Improved Ant Colony Algorithm with the Characteristic of Rolling Horizon Optimization to Job Shop Scheduling Problem with E/T Constraints
下载PDF
导出
摘要 随着JIT生产管理技术的出现和发展,考虑工件提前拖期费用的生产调度问题已经成为人们研究的热点领域。本文对蚁群算法进行了有效的改进,在状态转移规则中引入了有限时段滚动优化的特点,并应用在解决带交货期窗口的提前/拖期Job Shop问题上,仿真实验验证了改进算法的有效性,给出了相应问题的最优值的演化曲线图与Gantt排序图。 The emergence and development of JIT management technology open up a hot area of recent research for the iob scheduling and production management. Ant colony optimization algorithm, which has high optimization efficiency for practical application has shown great advantages in solving the combinatorial optimization problem. An improved ant colony optimization algorithm in which the characteristic of rolling horizon optimization is introduced is proposed and successfully applied in Job Shop scheduling problem with E/T constraints. The simulation results with the evolving figure and Gantt chart provided show the efficiency of the proposed algorithm.
出处 《华东理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第1期112-116,共5页 Journal of East China University of Science and Technology
基金 国家自然科学基金项目(60674075 60774078)
关键词 滚动优化 蚁群算法 车间作业调度问题 提前/拖期 交货期窗口 rolling horizon optimization ant colony algorithm Job Shop scheduling problem earliness/ tardiness due-date window
  • 相关文献

参考文献17

  • 1Bonabeau E, Dorigo M, Theraulaz G. inspiration for optimization from social insect behavior[J]. Nature, 2000, 406 (6791):39-42
  • 2Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies [A]. Proceedings of ECAL91- European Conf on Artificial Life [C]. Paris, France: Elsevier, 1991. 134- 142.
  • 3Gambardella L M, Taillard E D, Dorigo M. Ant colonies for the quadratic assignment problem [J]. Journal of Operation Research Science, 1999,50(2): 167-176.
  • 4Colorni A, Dorigo M, Maniezzo V. Ant system for lob-Shop scheduling [J], Belgian Journal of Operation Research Statis tics Computer Science, 1994, 34(1): 39-53.
  • 5Gutjahr W J. A graph based ant system and its convergence [J]. Future Generation Computer Systems, 2000, 16 (9) : 873-888.
  • 6王剑,李平,杨春节.蚁群算法的理论与应用[J].机电工程,2003,20(5):126-129. 被引量:27
  • 7田富鹏.改进型蚁群算法及其在TSP中的应用[J].兰州大学学报(自然科学版),2005,41(2):78-80. 被引量:6
  • 8段海滨,王道波.一种快速全局优化的改进蚁群算法及仿真[J].信息与控制,2004,33(2):241-244. 被引量:57
  • 9蒋建国,骆正虎,张浩,韩晓征,陈晓萍.基于改进型蚁群算法求解旅行Agent问题[J].模式识别与人工智能,2003,16(1):6-11. 被引量:15
  • 10陈知美,顾幸生.基于蚁群算法的Job Shop问题[A].第23届中国控制会议论文集(上册)[C].上海:华东理工大学出版社,2004.445-450.

二级参考文献67

  • 1郝晋,石立宝,周家启.具有随机扰动特性的蚁群算法[J].仪器仪表学报,2001,22(z1):350-352. 被引量:8
  • 2李平,顾幸生.用GA算法解不确定条件下Job Shop的提前/拖期调度问题[J].华东理工大学学报(社会科学版),2002,17(S1):11-14. 被引量:3
  • 3骆正山,王小完.基于模糊条件下车辆路径问题的研究[J].微电子学与计算机,2005,22(3):181-184. 被引量:11
  • 4[1]Baker K R. Sequencing with earliness and tardiness penalties:A review[J]. Oper Res, 1990,38:22-36.
  • 5[3]Pistikopoulos E N. Uncertainty in process design and operations[J]. Computers Chem Eng,1995,19(Suppl.):553-563.
  • 6[4]Masatoshi S, Tetsuya M. An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate[J]. Comput Ind Eng,1999,36(2):325-341.
  • 7[5]Wiede J R W, Kuriyan K, Peklatitis G V. Determination of completion times for serial multi-product processes[J]. Comput Chem Engng, 1987,11(4):337-344.
  • 8[7]Ha J K, Chang H K. Intermediate storage tank operation strategies in the production scheduling of multi-production batch processes[J]. Computers Chem Eng,2000,24(2-7):1 633-1 640.
  • 9Barto A G, Sutton R S, Brower P S, Associative search network: A reinforcement learning associative memory[ J ]. Biological Cybem,1981,40(2): 201-211.
  • 10Coloni A, Dorigo M, Maniezzo V, Ant system: Optimization by a colony of cooperating agent[J].IEEE Trans on Systems,Man and Cybemetics-Part B:Cybemetcs.1996,26(1):29-41

共引文献258

同被引文献6

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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