期刊文献+

基于改进蚁群算法的柔性作业车间调度问题的求解方法 被引量:30

Method to Resolve Flexible Job-shop Scheduling Problem Based on Improved Ant Colony Algorithm
原文传递
导出
摘要 针对经典作业车间调度问题的局限性,结合实际生产情况,给出了具有路径柔性的作业车间调度模型,提出了机器选择规则,给出了改进蚁群算法的具体实现过程。当所有蚂蚁爬行完毕后,针对算法是否陷入局部收敛分别对各路径上的信息素进行调整,这样有助于快速的得到全局最优解。最后通过实例仿真验证了算法的有效性。 Aiming at the limit of classical job-shop problem, combining with actual manufacture instance, a rout flexible job-shop model was given, a machine choose rule was advanced, the process of improved ant colony algorithm was given. After all ants crawled, this algorithm could adjust pheromone aiming at whether it got into part convergence, this could help algorithm to get best solution faster. In the end the simulation results show that this algorithm has good performance.
出处 《系统仿真学报》 EI CAS CSCD 北大核心 2008年第16期4326-4329,共4页 Journal of System Simulation
基金 国家863计划(2007AA04Z155) 国家自然科学基金(60374056 60573123)资助项目。
关键词 蚁群算法 改进蚁群算法 柔性作业车间调度 生产调度 ant colony algorithm improved ant colony algorithm flexible job-shop scheduling production scheduling
  • 相关文献

参考文献10

  • 1Dorigo M, Maniezzo V, Colorni A. The ant system: optimization by a colony of cooperating agents [J]. IEEE Transactions on Systems, Man, and Cybernetics-Part B (S 1094-6977), 1996, 26(1): 29-41.
  • 2王常青,操云甫,戴国忠.用双向收敛蚁群算法解作业车间调度问题[J].计算机集成制造系统,2004,10(7):820-824. 被引量:31
  • 3杨阿莉.一种改进蚁群算法在车间作业调度问题中的研究与应用[J].机械与电子,2005,23(4):9-12. 被引量:8
  • 4Chambers J B, Barnes J W. Tabu search for the flexible2routing job shop problem [R]// Austin: Technical Report Series ORP 96-10. USA: Department of Mechanical Engineering, The University of Texas at Austin, 1996.
  • 5Jansen K, Solis-Oba R, Sviridenko M I. A linear time approximation scheme for the job shop scheduling problem [C]//Dorit S Hochbaum, Klaus Jansen, Jose D P Rolin, Alistair Sinclair, eds. Proceedings of the Second International Workshop on Approximation Algorithms (APPROX 99). Berkeley: Springer, 1999.
  • 6庞哈利.柔性Job shop集成化计划调度模型及其求解算法[J].控制与决策,2003,18(1):34-39. 被引量:11
  • 7Leng Sheng, Wei Xiaobin, Zhang Weny. Improved aco scheduling algorithm based on flexible process [J]. Transactions of Nanjing University of Aeronautics & Astronautics (S 1005 - 1120), 2006, 23 (2): 154-160.
  • 8Hisao I, Shina M, Hides T. Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem [J]. Euro J. of Operation Research (S0377-2217), 1995, 81(2): 388-398.
  • 9赵巍,王万良.改进遗传算法求解柔性job-shop调度问题[J].东南大学学报(自然科学版),2003,33(Z1):120-123.
  • 10余琦玮,赵亮,潘双夏.基于遗传算法的柔性作业车间调度优化[J].组合机床与自动化加工技术,2004(4):32-34. 被引量:24

二级参考文献35

  • 1[1]Conwey R W, Maxwell W L, Miller L W. Theory of Scheduling[M]. Massachusetts: Addision-Wesley,1967.
  • 2[2]Adams J, Balas E, Uzsoy R. The shifting bottleneck procedure for job shop scheduling[J]. Mgmt Sci,1988,34(3):391-401.
  • 3[3]Lourenco H R. Job shop scheduling: Computational study of local search and large step optimization methods[J]. Eur J Opns Res,1995,83:347-364.
  • 4[4]Chen I J, Chung C H. Effects of loading and routing decisions on performance of flexible manufacturing systems[J]. Int J Prod Res,1991,29(11):2209-2225.
  • 5[5]Hutchision J, Leong K, Snyder D, et al. Scheduling approach for random job shop flexible manufacturing systems[J]. Int J Prod Res,1991,29(5):1053-1067.
  • 6[6]Jiang J C, Hsiao W C. Mathematical programming for the scheduling problem with alternate process plans in FMS[A]. Proc 16th ICC IE[C].Ashikaga,1993.368-371.
  • 7[7]LogendranR,SonthinenA.A tabu search-basedapproach for scheduling job-shop type flexible manufacturing systems[J]. J Opl Res,1997,48(3):264-277.
  • 8[8]Dueck G, Scheuer T. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing[J]. J Comput Physics,1990,90:161-175.
  • 9[9]Althofer I, Koschnick K U. On the convergence of "Threshold Accepting"[J]. Appl Math Optim,1991,24:183-195.
  • 10[10]Lawrance D. Handbook of Genetic Algorithms[M]. New York: Van Norstrand Reinhold,1991.

共引文献66

同被引文献218

引证文献30

二级引证文献157

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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