期刊文献+

基于蚁群算法和禁忌搜索算法的物流配送优化研究 被引量:3

下载PDF
导出
摘要 在分析带有时间窗的同时送货和取货的车辆路径问题(VRPSDPTW)的基础上建立数学模型,提出一种蚁群算法与禁忌搜索算法的新混合算法,详细地设计该算法的关键实现技术。实验表明,混合算法提高了全局搜索能力,加快了收敛速度,适合求解VRPSDPTW问题。
出处 《轻工科技》 2018年第8期96-99,共4页 Light Industry Science and Technology
基金 智慧城市大数据处理关键技术研究(教科技[2016]519)
  • 相关文献

参考文献3

二级参考文献28

  • 1陈崚,章春芳.并行蚁群算法中的自适应交流策略(英文)[J].软件学报,2007,18(3):617-624. 被引量:11
  • 2COLORNI 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.
  • 3SAVELSBERGH M. Local search for routing problem with time windows [J]. Annals of Operations Research, 1985,16(4) :285-305.
  • 4MARIUS M, SOLOMON M. Algorithms for vehicle routing and scheduling problems with time window constraints[J].Operations Research, 1987,35(2) :763-781.
  • 5THANGIAH 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.
  • 6JOE 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.
  • 7STUTZLE T,HOOS H H. Max-Min Ant System[J]. Future Generation Computer Systems, 2000,16(9): 889-914.
  • 8REIMANN 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.
  • 9BULLNHEIMER 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.
  • 10BRYSY 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.

共引文献56

同被引文献21

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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