期刊文献+

配装-运输集成决策模型及其遗传算法 被引量:3

Integrated decision model for goods loading-transportation and its genetic algorithm
在线阅读 下载PDF
导出
摘要 为了充分利用运输工具的装载力和优化运输路径,在充分考虑货物重量、体积及车辆装载力等约束条件下,建立配装-运输集成决策模型并用基于自然数编码的遗传算法对其求解.通过对高复杂度条件下的"遗传特性"分析,算法采用最大保留交叉及自适应交叉变异,最大限度地保留了父代的优良特性,改善基本遗传的"早熟"特性、增强算法的寻优能力并提高了解的精准度.编制了运行平稳的计算机程序,实例计算表明:配装-运输集成决策模型及算法可行有效,不仅使配送总行程节约了26.6%,而且使车辆载重量和体积平均利用率分别达到88%和86%. To make full uses of transportation means' loading-capacity and optimize the transportation path,with full consideration of the restraints of cargo weight and volume as well as loading-capacity,an integrated loading-transportation model was established,and to solve it,the genetic algorithm based on decimal coding was adopted.Through analysis to hereditary property under high complexity condition and adopting both maximum preserved crossover operator and adaptive crossover mutation,the algorithm not only furthest retains the parents' excellent properties and improves the basic genetic algorithm's premature properties,but also builds up the simple genetic algorithm's optimization capabilities and enhances the solution's accuracy.Program for the model was programmed and run smoothly.The example analysis and calculation result show that the integrated loading-transportation model and its solution algorithm are feasible and effective: it not only saves 26.6% of total path,but also makes the average utilization of loading-capacity and volume reach 88% and 86% respectively.
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2011年第9期1630-1635,共6页 Journal of Zhejiang University:Engineering Science
关键词 集成模型 货物装配运输 遗传算法 最大保留交叉 多目标优化 integrated model goods loading-transportation genetic algorithm maximum preserved crossover multi-objective optimization
  • 相关文献

参考文献15

  • 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-99.
  • 2BULLNHEIMER B, HARTL R F, STRAUSS C. An improved ant system algorithm for the vehicle routing problem[J]. Annals of Operations Research, 1999, 89:319-328.
  • 3孙焰,李致中.求双目标配装方案的多项式近似算法[J].长沙铁道学院学报,1997,15(2):33-39. 被引量:23
  • 4CLARKE G, WRIGHT J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research, 1964,12(4): 568-581.
  • 5GILLETT B, MILLER L. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974, 22(2): 340-349.
  • 6CHRISTOFIDES N, MINGOZZI A, TOTH P. Cominatorial optimization[M]. Chichester: Wiley,1979.
  • 7WARK P, HOLT J. A repeated matching heuristic for the vehicle routeing problem[J]. Operations Research Society, 1994, 45(10):1156-1167.
  • 8GLOVER F. Tabu searchPart I[J]. ORSA Journal on Computing, 1989,1(3):190-206.
  • 9AGNETIS A. Planning the routing mix in FASs to minimize total transportation time[J]. International Journal of Flexible Manufacturing Systems, 1996, (2):131-157.
  • 10DE MEULEMEESTER L, LAPORTE G, LOUVEAUX F V, et al. Optimal sequencing of skip collections and deliveries[J]. Journal of the Operational Research Society, 1997, 48(1): 57-64.

二级参考文献10

  • 1郭耀煌 李军.车辆优化调度[M].成都:成都科技大学出版社,1994..
  • 2Bonnie R M, Anandalingam G, Iraj Zandi.A genetic algorithm approach to policy design for consequence minimization [J].European Journal of Operational Research, 2000, 124(1): 43-54.
  • 3刘勇,康立山,陈毓屏.非数值平行算法(第二册)--遗传算法[M].北京:科学出版社,1998: 22-233.
  • 4Taichi K, Azuma O.A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs [J].European Journal of Operational Research, 1999, 112(1): 147-157
  • 5Mahmoud H A, Sigrún A.A simulated annealing algorithm with constant temperature for discrete stochastic optimization[J].Management Science , 1999; 45(5): 748-764.
  • 6谢秉磊,硕士学位论文,1999年
  • 7刘勇,非数值并行算法.2.遗传算法,1995年
  • 8郭耀煌,车辆优化调度,1994年
  • 9李致中.零担货物配装的数学模型[J]系统工程,1987(02).
  • 10李军.车辆调度问题的分派启发式算法[J].系统工程理论与实践,1999,19(1):27-33. 被引量:59

共引文献435

同被引文献29

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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