Please wait a minute...
浙江大学学报(工学版)
J4  2011, Vol. 45 Issue (9): 1630-1635    DOI: 10.3785/j.issn.1008-973X.2011.09.020
    
Integrated decision model for goods loading-transportation
and its genetic algorithm
XU Ke-lin, ZHU Wei, LI Yan-bing
College of Mechanical Engineering, Tongji University, Shanghai 201804, China
Download:   PDF(0KB) HTML
Export: BibTeX | EndNote (RIS)      

Abstract  

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．

Published: 01 September 2011
CLC:  TP 301  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:

XU Ke-lin, ZHU Wei, LI Yan-bing. Integrated decision model for goods loading-transportation
and its genetic algorithm. J4, 2011, 45(9): 1630-1635.

URL:

https://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2011.09.020     OR     https://www.zjujournals.com/eng/Y2011/V45/I9/1630


配装-运输集成决策模型及其遗传算法

为了充分利用运输工具的装载力和优化运输路径,在充分考虑货物重量、体积及车辆装载力等约束条件下,建立配装运输集成决策模型并用基于自然数编码的遗传算法对其求解.通过对高复杂度条件下的“遗传特性”分析,算法采用最大保留交叉及自适应交叉变异,最大限度地保留了父代的优良特性,改善基本遗传的“早熟”特性、增强算法的寻优能力并提高了解的精准度.编制了运行平稳的计算机程序,实例计算表明：配装-运输集成决策模型及算法可行有效,不仅使配送总行程节约了26.6%,而且使车辆载重量和体积平均利用率分别达到88%和86%.

［1］ TUZUN 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．
［2］ BULLNHEIMER 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．
SUN Yan, LI Zhizhong. The polynomial algorithms for the allocation problem with two aims［J］. Journal of Changsha Railway University, 1997,15(2):33-39．
［4］ CLARKE 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.
［5］ GILLETT B, MILLER L. A heuristic algorithm for the vehicle dispatch problem［J］. Operations Research, 1974, 22(2): 340-349.
［6］ CHRISTOFIDES N, MINGOZZI A, TOTH P. Cominatorial optimization［M］. Chichester： Wiley,1979．
［7］ WARK P, HOLT J. A repeated matching heuristic for the vehicle routeing problem［J］. Operations Research Society, 1994, 45(10):1156-1167．
［8］ GLOVER F. Tabu searchPart I［J］. ORSA Journal on Computing, 1989,1(3):190-206．
［9］ AGNETIS A. Planning the routing mix in FASs to minimize total transportation time［J］. International Journal of Flexible Manufacturing Systems, 1996, (2):131-157．
［10］ DE 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．
［11］ RUBENSTEINMONTANO B, ANANDALINGAM G, ZANDI I. A genetic algorithm approach to policy design for consequence minimization［J］. European Journal of Operational Research, 2000,124(1): 43-54.
［12］ 卜雷. 零担货物序贯装箱优化问题的遗传模拟退火算法［J］. 西南交通大学学报, 2002, 37(5):531-535．
BU Lei. A genetic and sumulated annealing algorithm for optimal sequential casing of lessthancarload freights［J］. Journal of Southwest Jiaotong University, 2002, 37(5):531-535．
［13］ 谢秉磊, 孙毅, 李荣喜. 求解配送＼ 收集旅行商问题的遗传算法［J］. 陕西工学院学报, 2002, 18(1): 70-74．
XIE Binglei, SUN Yi, LI Rongxi. Genetic algorithm solving salesman problem with pickup and delivery［J］. Journal of Shaanxi Institute of Technology, 2002, 18(1): 70-74．
［14］ 周明, 孙树栋. 遗传算法原理及应用［M］. 北京: 国防工业出版社, 2002: 33-64．
［15］ 玄光男, 程润伟. 遗传算法与工程设计［M］. 北京: 科学出版社, 2000: 83-88．
［16］ 李军, 谢秉磊,郭耀煌.非满载车辆调度问题的遗传算法［J］. 系统工程理论方法应用, 2000, 9(3):236-239．
LI Jun, XIE Binglei, GUO Huihuang. Genetic algorithm for vehicle scheduling problem with nonfull Load［J］. Systems EngingTheory Methodology Application, 2000, 9(3):236-239．
[1] CHEN Jing, ZHANG Shu-you. Dynamic schedule optimization based on correlation
scheduling model[J]. J4, 2011, 45(2): 240-246.
[2] DONG Li-Da, CHENG Xi-Gao, ZHENG Han. Properties research of Petri nets safety place substitution[J]. J4, 2010, 44(9): 1711-1718.
[3] DONG Li-Da, ZHENG Han, CHENG Xi-Gao. Explicitcontroller design for a class of controlled Petri nets with marked graph loops[J]. J4, 2010, 44(6): 1057-1066.
[4] DING Chun, FENG Zhi-Yong. Approach for fluctuation complexity oriented context prediction[J]. J4, 2010, 44(2): 220-224.
[5] MENG Jie,LIU Hua-feng,YUE Mao-xiong,HU Hong-jie. Biomechanical model guided dual estimation of myocardial
motion and material parameters[J]. J4, 2012, 46(5): 912-917.