期刊文献+

单车辆物流配送决策模型及其遗传算法 被引量:5

Decision-making Model and Its Genetic Algorithm for Single-vehicle Distribution
下载PDF
导出
摘要 从提高装配运输系统运作效率及效益的角度出发,综合考虑配送时窗、配送重量、体积及车辆装载力等约束因素,建立了单车辆配装运输决策模型.通过遗传算法应用在模型中的适应性分析及可能存在的问题或缺陷分析,采用自然数编码、最大保留交叉及自适应交叉变异等技术以遗传父代优良特性、改善算法的早熟及进化停滞现象并增强其寻优性能.算法中嵌入配送重量、体积及配送时窗约束检验子程序以减小编码难度并提高解的精准度.最后以实例说明模型的应用,并指出进一步的研究方向. To improve efficiency and benefit for loading-transportation system,a decision-making model for single vehicle loading-transportation,under comprehensive consideration of the restraints of goods weight and volume as well as loading capacity of vehicle and time-window,is developed.Based on an analysis of the adaptability for genetic algorithm application to the model as well as its possible problems or defects,technologies such as decimal coding and maximum preserved crossover operator as well as adaptive crossover mutation are adopted to inherit good properties of parents and improve the phenomenon of algorithm premature and stagnation as well as enhance its optimization performance.Constraint test subroutine for distribution weight,volume and delivery time window embedded in genetic algorithm in order to reduce the coding difficulty and improve solution's accuracy.An example is given to explain the process.In the end,further research orientation is discussed.
出处 《同济大学学报(自然科学版)》 EI CAS CSCD 北大核心 2011年第6期848-852,共5页 Journal of Tongji University:Natural Science
关键词 配运决策模型 遗传算法 最大保留交叉 约束检验 decision model for physical distribution genetic algorithm maximum preserved crossover constraint test
  • 相关文献

参考文献14

  • 1Tuzun D, Burke L I. A two-phase tabu search approach to the location routing problem[J]. European Journal of Operational Research, 1999,116 ( 1 ): 87.
  • 2Mosheiov G. The travelling salesman problem with pick-up and delivery[J]. European Journal of Operation Research, 1994, 79 (2) :299.
  • 3Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research, 1964,12 (4) : 568.
  • 4Gillett B, Miller L. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974,22 (2) : 340.
  • 5Lin S. Computer solutions of the traveling salesman problem [J]. Bell System Technology Journal, 1965,44 (10) : 2245.
  • 6Norback J P, Love R F. Geometric approaches to solving the traveling salesman problem[J] (11) :1208.
  • 7Landrieu A, Mati Y, Binder Z. A tabu search heuristic for the single vehicle pickup and delivery problem with time windows [J]. Journal of Intelligent Manufacturing, 2001,12 (5 - 6) :497.
  • 8Holland J H. Adaptation in natural and artificial system IMP. Ann Arbor:The University of Michigan Press, 1975.
  • 9Grefenstette J, Gopal R, Rosimaita B, et al. Genetic Algorithms for the traveling salesman problem[C]//Proceedings of the 1st International Conference on Genetic Algorithm and Their Applications. Pittsburgh: Lawrence Erlbaum, 1985 .- 160 - 168.
  • 10王蕾,沈庭芝,招扬.一种改进的自适应遗传算法[J].系统工程与电子技术,2002,24(5):75-78. 被引量:49

二级参考文献6

共引文献453

同被引文献43

  • 1张之富,余静,凌镭,周恒.基于改进遗传算法的车辆优化调度研究[J].中国水运(下半月),2009,9(4):73-75. 被引量:8
  • 2杨锦冬,徐丽群.城市物流中心车辆配送配载调度指派模型研究[J].同济大学学报(自然科学版),2004,32(11):1452-1456. 被引量:15
  • 3王涛,蔡延光,张新政.现代物流中车辆路径问题的研究[J].物流科技,2005,28(1):32-34. 被引量:3
  • 4曹明兰,郎茂祥,曹明琴,乔晓东.考虑客户需求优先级的货物配装问题的模型与算法研究[J].物流科技,2006,29(7):69-72. 被引量:5
  • 5Landrieu A, Mati Y, Binder Z. A tabu search heuristic for the single vehicle pickup and delivery problem with time windows [J]. Journal of Intelligent Manufacturing, 2001,12, (5 - 6) :497.
  • 6Dantzig G B, Ramser J H. The truck dispatching problem [J]. Management Science, 1959, 6(1) :80- 91.
  • 7Pillae V, Gendreau M, Gueret C, et al. A review of dynamic vehicle routing problems [J]. European Journal of Operational Research, 2013, 225(1) :1-11.
  • 8YU Bin, YANG Zhong-zhen, YAO Bao-zhen. An improved ant colony optimization for vehicle routing problem [J ]. European Journal of Operational Research, 2009, 196(1) :171-176.
  • 9Bortfeldt A. A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints [J]. Computers and Operations Research, 2012, 39(9) :2248-2257.
  • 10Savelsbergh M W P. Local search in routing problems with time windows [J ]. Annals of Operations Research, 1985, 4(1) : 285-305.

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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