期刊文献+

多车场满载车辆路径问题遗传算法 被引量:2

GENETIC ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH MULTI-DEPOTS AND FULL LOADS
下载PDF
导出
摘要 研究了多车场多配送中心车辆的路径问题,以提高物流配送效率.在分析了问题有效解的基础上,制定了相应的染色体分段编码,给出了合适的适应值函数,使杂交变异得到的新基因具有更好的健壮性.为了克服传统遗传算法早熟的缺点,作者结合模拟退火算法和小生境遗传算法,以无序的方式进行杂交和随机点的基因变异,保证了进化后的种群多样性,并且杂交选择方式使得算法收敛性较佳.通过实例检验,在可行解的集合内该方法收敛于近似最优解. Studying VRP of multi-depots and multi-distribution centers can improve efficiency of logistics and distribution.Corresponding code of chromosome segment is set in the analysis of effective solutions for the problem.The appropriate fitness function ensures that the hybrid gene mutation has better robustness.Combined with simulated annealing algorithm and niche genetic algorithm disorderly hybrid approach and mutations of random point are used overcoming the premature shortcoming of the traditional genetic algorithm.Population diversity reserves as to this evolution and the method of hybrid determines the convergence of the algorithm.The instance shows that this algorithm could find approximate optimal solution efficiently.
出处 《陕西科技大学学报(自然科学版)》 2011年第2期69-74,共6页 Journal of Shaanxi University of Science & Technology
关键词 物流 遗传算法 满载运输 车辆路径问题 优化 logistics genetic algorithm full loaded transportation vehicle routing problem optimize
  • 相关文献

参考文献12

二级参考文献45

共引文献76

同被引文献23

  • 1郭耀煌,李军.满载问题的车辆路线安排[J].系统工程学报,1995,10(2):106-118. 被引量:15
  • 2霍佳震,张磊.用节约法解决带有时间窗的满载车辆调度问题[J].工业工程与管理,2006,11(4):39-42. 被引量:13
  • 3吴升,王钦敏,彭国勇,励惠国.基于改进遗传算法的多约束VRP求解[J].测绘科学技术学报,2006,23(6):396-399. 被引量:3
  • 4GENNADY AADRIENKO, NATALIA AADRIENKO, ULRICH BARTLING. Visual Analyties Approach to Us- er-Controlled Evacuation Scheduling. (2008-06-01)[2012- 03-12]. http://www, geoanalytics, net/.
  • 5REEVES C R, ROWE J E. Genetic Algorithms-Principles and Perspectives[M]. New York: Springer Berlin Heidel- berg New York, 2002: 5-8.
  • 6GENNADY ANDRIENKO, NATALIA ANDRIENKO. Geovisual Analytics for Spatital Decision Support[J]. In- ternational Journal Geographical Information Science, 2007,21(8) :839-857.
  • 7Bali M, Golden B L, Assad A A. Planning for truck fleet size in the presence of a common-carrier option[J]. Decision Sci- ence, 1993(14):103-120.
  • 8Arunapuram S, Mathur K, Solow D. Vehicle routing and scheduling with full truckloads[J]. Transportation Science, 2003,37(2): 170-182.
  • 9Gronalt M, Hartl R F, Reimann M. New savings bas-ed algorithms for time constrained pickup and delivery of full truck- loads[J]. European Journal of Operational Research, 2003,151(3):520-535.
  • 10Liu R, Jiang Z, Liu X, et al. Task selection and routing problems in collaborative truckload transportation[J]. Transportation Research Part E: Logistics and Transportation Review, 2010,46(6):1071-1085.

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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