乘用车物流运输计划的远程优先算法.pdf

2016年第6淛 信息技术 文章编号：1〇〇9 - 2552 (2016)06 - 0049 - 05 DOI ：10.13274/j. cnki. hdzj. 2016. 06. 014 乘用车物流运输计划的远程优先算法 郭东威\ 丁根宏\毛俊诚、 陈玉磊2 .(1.钶海大学理学_ ，倉京_.211100; 2.北京科:技大学数理学.晓，.北盒10008.3) 摘 要：为 高乘用车物流运输效率，降低运输成本，首先以轿运车装载总长度最大为目标建 立了最大运能数学模型，其次根据目的地位置分布的特点，将目的地分别放置在若干条路径上， 提出了远程优先算法，并以轿运车使用数量最少及总行驶里程最短为目标，建立了多目标整数 组合优化数学模型D 利用该模型对2014年全国研究生数学建模竞赛E ^ a 第4 问求解，获得了其 最优配送方案：轿运车最少使用数量为25辆，其中1 - 1 型_轿运车21辆，1 - 2 型轿运车4 辆， 最短总里程为6404。 关键词：整车物流；最大运能；远程优先算法：多目标规划；组合优化 中图分类号：TP301.6; F426.471 文献标识码： A Remote priority algorithm for passenger cars logistics transportation plan GUO Dong-wei1, DING Gen-hong1, MAO Jun-cheng 1 , CHEN Yu-lei2 (1. School of Science, Hohai University, Nanjing 211100, China ； 2. School of Mathematics and Physics,Beijing University of Science and Technology,Beijing 100083, China) Abstract ： To improve the efficiency of pa enger cars logistics transportation and reduce the transportation c^osts, firstly with the goal of maximum c^ar carriers total loading length this paper established the maximum transportationJ s c*apacnty mathematic^al model, and then placed destinations in several paths based on their locations characteristics， proposed remote priority algorithm, and with the goals of minimum amount of c*ar c*arriers and shortest total driving distance established multi-objective integer (combination optimization model. Using this model to the E fourth question of the National Mathematical Modeling Contest for Postgraduates in 2014,it obtained its optimal delivery program ： car carriers minimum number is 25 (21 1 — 1