期刊文献+

模糊约定时间车辆路径问题及其蚂蚁算法求解 被引量:14

Ant algorithm for vehicle routing problem with fuzzy due-time
下载PDF
导出
摘要 模糊约定时间车辆路径问题是基于模糊预约时间,体现顾客偏好的一种车辆路径问题.建立了该问题的数学模型,针对其多目标性质,对几个目标分别给以权系数进行线性加权.在蚂蚁算法思想基础上,设计了用于求解该问题的改进型算法,并计算了Solomon问题库中的实例.经过大量数据测试,分析了蚂蚁算法中各参数以及各目标权系数的不同取值组合对结果的影响,获得了较好的结果. Vehicle routing problem with fuzzy due-time is a type of vehicle routing problem which reflects customers' bias based on fuzzy due time. This paper establishes its mathematical model with the property of multi-objectives by linear combination of weights. Based on the idea of ant colony optimization, an improved ant algorithm for solving this problem is designed and some Solomon instances are solved. Series of numerical examples are tested and the influence of the combination of parameters in ant algorithm and weighs of varied objective on solutions is analyzed which results in good performance.
出处 《系统工程学报》 CSCD 北大核心 2009年第4期489-493,共5页 Journal of Systems Engineering
基金 国家自然科学基金资助项目(70871081) 中国工程院重点咨询项目(2006-X-16) 博士后科学基金资助项目(20060400583) 上海市(第三期)重点学科建设资助项目(S30504)
关键词 车辆路径问题 蚂蚁算法 模糊约定时间 VRP ant algorithm fuzzy due-time
  • 相关文献

参考文献15

  • 1Gambardella L M, Taillard E D, Agazzi G. MACS-VRFINV : A multiple ant colony system for vehicle routing problems with time windows[ A]. New Ideas in Optimization[ C]. London: blcGmw-Hill, 1999. 63--76.
  • 2Cheng R, Gen M. Vehicle routing problem with fuzzy due-time using genetic algorithms [ J ]. Japanese Journal of Fuzzy Theory and Systems, 1995, 7(5) : 1050--1061.
  • 3Thangiah S R, Nygard K E, Juell P G. A genetic algorithm system for vehicle routing with time windows [ A ]. Proceeding of Seventh IEEE Conference on Artificial Intelligence Applications[ C]. Florida, 1991. 322--328.
  • 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.
  • 5Cheng R, Gen M. Vehicle routing problem with fuzzy due-time using genetic algorithms[ J]. Japanese Journal of Fuzzy Theory and Systems, 1995, 7(5) : 1050--1061.
  • 6Cheng R, Gen M. Fuzzy vehicle routing and scheduling problem using genetic algorithms[ A]. Genetic Algorithms and Soft Computing[ M]. Heidelbeng: Physica-Verlag, 1996. 683--709.
  • 7张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报,2005,8(3):64-71. 被引量:34
  • 8Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies[ A]. Proceedings of the First European Conference on Artificial Life[ C]. Paris, France: Elsevier Publishing, 1991. 134--142.
  • 9Dorigo M, Maniezzo V, Colomi A. Ant system: Optimization by a colony of cooperating agents [ J ]. IEEE Transactions on SMC, 1996, 26(1) : 29-41.
  • 10马良,蒋馥.度限制最小树的蚂蚁算法[J].系统工程学报,1999,14(3):211-214. 被引量:53

二级参考文献53

  • 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.

共引文献348

同被引文献152

引证文献14

二级引证文献97

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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