期刊文献+

基于改进最大-最小蚂蚁系统的多工艺路线决策方法 被引量:14

Multi-process routes decision-making methodology based on improved max-min ant system
下载PDF
导出
摘要 为实现工艺规划与生产调度的集成,提出了基于最大-最小蚂蚁系统的多工艺路线决策方法。给出了零件可行性工艺路线图的概念,建立了多工艺路线决策问题的数学模型,从而将零件的工艺路线规划问题转化为对零件可行性工艺路线图中具备最优值的路径搜索和寻优问题。提出了基于精英蚂蚁排序策略的改进最大-最小蚂蚁系统,并设计了算法流程。最后,通过仿真实例,验证了改进算法具有的良好的鲁棒性,并在性能上优于其他算法。 To realize integration of process planning and production scheduling, a multi process routes decision mak ing methodology based on Max-Min Ant System (MMAS) was proposed. Concept of the feasible process graph for a part was defined and the mathematic model of multi process routes decision-making problem was set up. Thus, the problem of multi-process routes decision-making was transformed into the problem of searching optimum path in this directed graph. Moreover, an improved MMAS based on the strategy of sorting elite ants was presented and the algorithm process was designed. Finally, robustness of the proposed algorithm was proved by simulations, and it out performed other algorithms.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2008年第12期2414-2420,共7页 Computer Integrated Manufacturing Systems
基金 国防科工委基础科研资助项目(D0420060521)~~
关键词 多工艺路线 决策 最大-最小蚂蚁系统 可行性工艺路线图 计算机辅助工艺规划 蚁群优化 multi-process routes decision making max-min ant system feasibility process graph computer aided process planning ant colony optimization
  • 相关文献

参考文献16

  • 1DERELI T, FII.IZ I H. Optimization of process planning functions by genetic algorithms[J]. Computers & Industrial Engineering, 1999, 36(2) :281-308.
  • 2WONG F S Y, CHUAH K B, VENUVINOD P K. Automated inspection process planning., algorithmic inspection feature recognition, and inspection case representation for CBR[J]. Robotics and Computer-Integrated Manufacturing, 2006, 22 (1) :56-68.
  • 3LAURENT S, FRANCOIS V. OMEGA, an expert CAPP system[J].Advances in Engineering Software, 1996, 25(1):51 -59.
  • 4SUN G, SEQUIN C H, WRIGHT P K. Operation decomposition for freeform surface features in process planning [J]. Computer Aided Design, 2001, 33(9):621- 636.
  • 5YANG Y N, PARSAEI H R, LEEP H R. A prototype of a feature-based multiple-alternative process planning system with scheduling verification[J]. Computers & Industrial Engineering, 2001, 39(1/2) :109-124.
  • 6ZHANG W B, LU Z H, ZHU G Y. Optimization of process route by genetic algorithms[J].Robotics and Computer-Integrated Manufacturing, 2006, 22(2) : 180-188.
  • 7LI L, FUH J Y H, ZHANG Y F, et al. Application of genetic algorithm to computer-aided process planning in distributed manufacturing environments[J]. Robotics and Computer-Integrated Manufacturing, 2005, 21(6):568-578.
  • 8MEI J N, ZHANG H C, OLDHAM W J B. A neural network approach for datum seleclion in computer-aided process planning[J].Computers in Industry, 1995, 27(1) :53-64.
  • 9王忠宾,许娟,张永忠,陈禹六.智能CAPP系统及其加工资源动态决策[J].中国矿业大学学报,2006,35(3):317-322. 被引量:7
  • 10MOON C, SEO Y. Evolutionary algorithm for advanced process planning and scheduling in a multi plant[J].Computers & Industrial Engineering, 2005, 48(2) :311-325.

二级参考文献44

  • 1COLORNI A, DORIGO M, MANIEZZO V. Distributed optimization by ant colonics [A]. Proceedings of 1st European Conference on Artificial Life (ECAL'91)[C]. Paris, France:Elsevier Publishing, 1991. 134- 142.
  • 2SAVELSBERGH M. Local search for routing problem with time windows [J]. Annals of Operations Research, 1985,16(4) :285-305.
  • 3MARIUS M, SOLOMON M. Algorithms for vehicle routing and scheduling problems with time window constraints[J].Operations Research, 1987,35(2) :763-781.
  • 4THANGIAH S, NYGARD K,JUELL P G. A genetic algorithm system for vehicle routing with time window[A]. Proceedings of the Seventh Conference on Artificial Intelligence Applications[C]. Florida, USA: Morgan Koufmann Publishers, 1991. 322-325.
  • 5JOE L,ROGER L. Multiple vehicle routing with time and capacity constrains using genetic algorithms[A]. Proceedings of the Fifth International Conference on Genetic Algorithms[C].Florida, USA: AAAI, 1993. 452-459.
  • 6STUTZLE T,HOOS H H. Max-Min Ant System[J]. Future Generation Computer Systems, 2000,16(9): 889-914.
  • 7REIMANN M,DOERNER K,HARTL R F. D-Ants: savings based ants divide and conquer the vehicle routing problem [J]. Computers & Operations Research, 2004,31 (5): 563-591.
  • 8BULLNHEIMER B, HARTL R, STRAUSS C. An improved ant system algorithm for the vehicle routing problem [J]. Annals of Operations Research 1999, 89 (13): 319 -328.
  • 9BRYSY O,DULLAERT W. A fast evolutionary metaheuristic for the vehicle routing problem with time windows[J].International Journal of Artificial Intelligence Tools, 2002,12 (2):143-157.
  • 10ZHANG H C, Mallur S. An integrated model of process planning and production scheduling[J]. International Journal of Computer Integrated Manufacturing, 1994,7(6) :356-365.

共引文献103

同被引文献194

引证文献14

二级引证文献134

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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