对乘用车物流运输计划问题进行了研究,首先,建立了以单辆轿运车实载率最大为目标的单车最佳装载方案模型,以该方案配送乘用车辆直到运输任务完成以获得初始轿运车数,其次以空载率最小为目标设计了数量调整模型对初始轿运车数进行优化,得到最优装载方案模型.基于上述优化模型计算最小的轿运车数,建立在轿运车数量限制下的最短行驶里程模型,选择总行驶里程最小的装载方案作为最优的配送方案.最后建立基于路径的物流运输装载模型,运用Floyd算法计算任意起讫点间的最短路径,设计了一种全局搜索算法得到一种合理的配送方案,并以空载率最小为目标对方案进行优化.
This paper studies on logistics transportation planning problem of passenger vehicles. In part 1, the best single-vehicle loading plan model is firstly built to maximize actual loading ratio of single-vehicle. The proposed plan is applied to deliver passenger vehicles to get the initial number of car until assignment is accomplished. And then the initial number of car is optimized based on quantity-adjustment model to minimize the empty loading rate. Hence, optimal loading plan is also obtained. In part 2, the shortest mileage model limited by the number of car;which is based on the above results is built to choose the best optimal delivery plan. In Part 3 the logistics transportation loading model is built based on the paths. It utilizes Floyd algorithm to compute the shortest path between the origin and the terminal and design a global searching algorithm to get a reasonable delivery plan. Finally, the obtained plan is optimized to minimize the empty loading rate.