期刊文献+

车辆路径问题的微粒群算法分析与设计

Research in Vehicle Routing Problem Based on Particle Swarm Optimization
下载PDF
导出
摘要 车辆路径优化问题是一类具有重要实用价值的组合优化问题,微粒群算法是一种新的群体智能优化方法。该文在构造车辆路径问题的粒子表达方法基础上,分析了不同参数条件下微粒群算法求得此问题的情况。仿真结果表明微粒群算法可以快速、有效地得到问题的最优解,是求解车辆路径问题的一个较好方案。 The vehicle routing problem(VRP) is an important kind of combination optimization problem.The particle swarm optimization(PSO) is a kind of swarm intelligence optimization.Basis on the particle presentation of the vehicle routing problem,this paper analyses the performance of PSO on the condition of different problem.The results of experiment indicate that the PSO can quickly and effectively get optimal solution,which demonstrates that the PSO is an effective method to solve the vehicle routing problem.
作者 柳毅
出处 《杭州电子科技大学学报(自然科学版)》 2008年第1期77-81,共5页 Journal of Hangzhou Dianzi University:Natural Sciences
基金 杭州电子科技大学科研启动基金资助项目(KYS031507044)
关键词 车辆路径问题 微粒群算法 搜索 vehicle routing problem particle swarm optimization searching
  • 相关文献

参考文献4

  • 1郎茂祥,胡思继.车辆路径问题的禁忌搜索算法研究[J].管理工程学报,2004,18(1):81-84. 被引量:77
  • 2[2]Eberhart R C,Kennedy J.A new optimizer using particle swarm theory.Proceedings of the Sixth International Symposium on Micro Machine and Human Science[C].Nagoya,Piscataway,NJ:IEEE Service Center,1995:39-43.
  • 3[3]Kennedy J,Eberhart R.C.Particle Swarm Optimization[A].In:Proc IEEE Int'l.Conf.on Neural Networks,IV[C].Piscataway,NJ:IEEE Service Center,1995:1942-1948.
  • 4崔雪丽,马良,范炳全.车辆路径问题(VRP)的蚂蚁搜索算法[J].系统工程学报,2004,19(4):418-422. 被引量:48

二级参考文献19

  • 1[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.
  • 2[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.
  • 3[3]Colorni A, et al. Heuristics from nature for hard combinatorial optimization problems[J]. International Transactions in Operational Research, 1996, 3 (1): 1-21.
  • 4[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.
  • 5Dantizig G., Ramser J.. The truck dispatching problem[J].Management Science,1959,6: 80 ~ 91.
  • 6Gillett B. E. and Miller L R.. A heuistic algorithm for the vehicle dispatch problem. Opns. Res., 1974,22: 340 ~ 349.
  • 7Gendreau M., Hertz A., Laporte G.. A tabu search heuristics for the vehicle routing problem[J]. Management Science, 1994,40: 1276~1290.
  • 8Gendreau M.. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers[J]. Operation Research,1996,44(3):469 ~ 477.
  • 9Jiefeng Xu, james P. K.. A network tlow-based tabu search heuristic for the vehicle routing problem[J]. Transportation Science, 1996,30(4):379 ~ 393.
  • 10Barbarrosoglu, Gulay, Ozgur. Tabu search algorithm for the vehicle routing problem[J]. Computers & Operations Research, 1999, 26(3):255 ~ 270.

共引文献122

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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