期刊文献+

基于混合遗传算法的车辆优化配置的数学模型

Mathematical Model of Optimizing Number of Vehicles Based on Hybrid Genetic Algorithm
下载PDF
导出
摘要 研究了物流运输系统车辆数优化问题的数学模型,构造出了模拟退火算法的能量函数,根据该函数可以求最优车辆数,又可以求最优车辆数下的最优行驶路径.用遗传模拟退火算法实现了车辆数的优化计算与路径优化计算. This paper studies the mathematic model about computing optimum number of vehicles of logistic transport system, and constructs energy function of simulated annealing algorithm, according to which I can calculate the optimal number of vehicles, and can find shortcuts of vehicles running under the optimal number of vehicles. The use of simulated annealing genetic algorithm can result in the optimization calculation of Vehicles and their routing.
作者 夏雪
出处 《东莞理工学院学报》 2009年第1期36-41,共6页 Journal of Dongguan University of Technology
关键词 车辆数优化 能量函数 适应度函数 遗传模拟退火算法 optimizing number of vehicles energy function fitness function genetic simulated annealing algorithm
  • 相关文献

参考文献4

  • 1Fischetti Matteo.A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs [J]. Operations Research, 1994, 42(5): 846-849.
  • 2张涛,张玥杰,王梦光.不确定车辆数的车辆路径问题模型和混合算法[J].系统工程理论方法应用,2002,11(2):121-124. 被引量:33
  • 3周明 孙树栋.遗传算法原理及其应用[M].北京:国防工业出版社,1996..
  • 4Kirkpatrick S, Gclart C D, Veccbi M P. Optimization by Simulated Annealing[J]. Science, 1983,220:671-680.

二级参考文献9

  • 1[1]Dantzig G, Ramser J. The truck dispatching problem[J]. Management Sci,1959,6:80-91.
  • 2[2]Fischetti Matteo. A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs[J]. Operations Research,1994,42(5):846-849.
  • 3[3]Vigo Daniele. A heuristic for the asymmetric capacitated vehicle routing problem[J]. European Journal of Operational Research,1996,89:108-126.
  • 4[4]Gendreau Michel. A tabu search heuristic for the vehicle routing problem[J]. Management Sci,1994,40(10):1276-1290.
  • 5[5]Attahiru Sule Alfa. A 3-opt based simulated annealing algorithm for vehicle routing porblems[J]. Computers Ind Engng,1991,21(1-4):635-639.
  • 6[6]Marshall L Fisher. Optimal solution of vehicle routing problems using minimum K-trees[J]. Operations Research,1994,42(4):626-642.
  • 7[7]Glover Fred. Tabu search-partⅠ[J]. ORSA Journal on Computing,1989,1(3):190-205.
  • 8[8]Glover Fred. Tabu Search-part Ⅱ[J]. ORSA Journal on Computing,1990,2(1):4-32.
  • 9[9]Christofides N, Eilon S. An algorithm for the vehicle dispatching problems[J]. Operations Research,1969,20:309-323.

共引文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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