期刊文献+

带时间窗车辆路径问题的混合改进型蚂蚁算法 被引量:8

Hybrid improved ant algorithm for vehicle routing problem with time windows
下载PDF
导出
摘要 带时间窗车辆路径问题(VRPTW)是VRP的一种重要扩展类型,在蚂蚁算法思想基础上,设计用于求解该问题的混合改进型算法并求解Solomon标准数据库中的大量实例。经过大量数据测试并与其他启发式算法所得结果进行比较,获得了较好的效果。 Vehicle Routing Problem with Time Windows(VRPTW) is a very important extended type of Vehicle Routing Problem(VRP).Based on the idea of ant colony optimization,a hybrid improved ant algorithm for solving this problem is designed and some Solomon instances are solved.Computational experiments are tested and the results are compared with some other heuristic methods which is promising in good performances.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第4期16-19,共4页 Computer Engineering and Applications
基金 国家自然科学基金No.70471065 博士后科学基金资助项目No.20060400583~~
关键词 带时间窗车辆路径问题 混合蚂蚁算法 转移概率修正 Vehicle Routing Problem with Time Windows(VRPTW) hybrid ant algorithm transition probability amending
  • 相关文献

参考文献16

  • 1Gambardella L M,Taillard E D,Agazzi G.MACS-VRPTW:A multiple ant colony system for vehicle routing problems with time windows[J].New Ideas in Optimization, 1999: 63-76.
  • 2Thangiah S R,Nygard K E,Juell P G.A genetic algorithm system for vehicle routing with time windows[C]//Proceeding of Seventh IEEE Conference on Artificial Intelligence Applications,Florida, 1991 : 322-328.
  • 3Garcia B L,Potvin J Y,Rousseau J M.A parallel implementation of the tabu search heuristics for vehicle routing problems with time windows constraints[J].Computers & Operations Research, 1994,2( 1 ) : 1025-1033.
  • 4Chiang W,Russell R.Simulated annealing metaheuristics for the vehicle routing problem with time windows[J].Annals of Operations Research, 1996,6( 3 ) : 3-27.
  • 5Colorni A,Dorigo M,Maniezzo V.Distributed optimization by ant colonies[C]//Proc of the First European Conf on Artificial Life.Paris, France:Elsevier Publishing, 1991 : 134-142.
  • 6Dorigo M, Maniezzo V, Colorni A.Ant system : Optimization by a colony of cooperating agents[J].IEEE Trans on SMC,1996,26(1): 29-41.
  • 7马良,蒋馥.度限制最小树的蚂蚁算法[J].系统工程学报,1999,14(3):211-214. 被引量:53
  • 8马良,蒋馥.多目标旅行售货员问题的蚂蚁算法求解[J].系统工程理论方法应用,1999,8(4):23-27. 被引量:46
  • 9马良,项培军.蚂蚁算法在组合优化中的应用[J].管理科学学报,2001,4(2):32-37. 被引量:160
  • 10Cui Xue-li,Ma Liang,Fan Bing-quan.Ant colony optimization for VRP[C]//Proc of 2002 Int Conf on Management Science & Engi-neering (Vol.Ⅱ).Harbin: Harbin Institute of Technology Press, 2002 : 2057-2061.

二级参考文献41

  • 1马良.多准则货郎问题及其算法.运筹学的理论与应用[M].西安:西安电子科技大学出版社,1996.187-192.
  • 2[1]Laporte G. The vehicle routing problem: An overview of exact and approximation algorithms [ J ]. European Journal of Operational Research, 1992, 5 (9): 345-358.
  • 3[2]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperation agents[J]. IEEE Transactions on Systems,Man, and Cybernetics, 1996, 26 (1): 29-41.
  • 4[3]Colorni A, et al. Heuristics from nature for hard combinatorial optimization problems[J]. International Transactions in Operational Research, 1996, 3 (1): 1-21.
  • 5[11]Ma Liang, Yao Jian. A new alg orithm for integer programming problem[ A]. Proc. of 2001 Int. Conf. on Management Science & Engineering[C]. Harbin: Harbin Institute of Technology Press, 2001. 534-537.
  • 6Dorigo M, Maniezzo V, Colorni A. The ant system:Optimization by a colony of cooperating agents [J].IEEE Trans on SMC, 1996,26(1):28-41.
  • 7Dorigo M, Gambardella L M. Ant colony system.. A cooperative learning approach to the traveling salesman problem[J]. IEEE Trans on Evolutionary Computing,1997,1 (1) : 53-56.
  • 8Colorni A, Dorigo M, Maniezzo V. Ant colony system for job-shop scheduling [J]. Belgian J of Operations Research Statistics and Computer Science, 1994,34 (1):39-53.
  • 9Maniezzo V. Exact and approximate nondeterministic tree search procedures for the quadratic assignment problem[J]. Informs J of Computer, 1999, (11) :358-369.
  • 10Bilchev G, Parmee I C. The ant colony metaphor for searching continuous design spaces[J]. Lecture Notesin Computer Science, 1995, 993:25-39.

共引文献323

同被引文献75

引证文献8

二级引证文献100

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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