The vehicle loading problem with a heterogeneous transport fleet
The vehicle loading problem with a heterogeneous transport fleet
复制标题
DOI：
10.1016/j.cie.2016.04.021
复制
发表时间：
2016-07
期刊：
影响因子：
--
通讯作者：
Jiansheng Liu;Alice E. Smith;Dan Qian
中科院分区：
文献类型：
--
作者：
Jiansheng Liu;Alice E. Smith;Dan Qian
作为车辆装载问题的一个新兴变体，我们对整车物流中的异构多类型车队车辆装载问题（HVLP-FVL）进行了建模和解决。 HVLP-FVL 最大化了车队的总利润，其中不同型号的成品车辆会产生不同的利润，并且根据行驶距离考虑路线成本。针对车辆结构，定义了成品车辆和运输车辆的简化几何模型。优化考虑哪些成品车订单运输，然后对运输车辆进行装载分配。为了提高传统分支定界算法的计算性能，提出了一种基于振荡分析的贪婪搜索增强算法。通过真实案例研究来评估改进算法的有效性，并对一组成品车装载问题进行了一系列实验。结果表明，所提出的方法具有优越的性能，并且在实践中满足了用户的需求。本文的贡献是对汽车制造物流中实际复杂问题的建模和解决，以及可用于其他问题类别的简单分支定界加速。
As an emerging variant of the vehicle loading problem, the heterogeneous multi-type fleet vehicle loading problem in finished vehicle logistics (HVLP–FVL) is modeled and solved. The HVLP–FVL maximizes the total profit of a vehicle fleet where different models of finished vehicles result in different profits and routing costs are considered based on distance traveled. Addressing the vehicle structures, simplified geometric models of both the finished vehicle and transport vehicle are defined. The optimization considers which finished vehicle orders to transport and then makes the loading assignment to the transport vehicles. To improve the computational performance of the traditional branch and bound algorithm, an enhancement using greedy search based on oscillation analysis is proposed. A real case study is used to evaluate the effectiveness of the improved algorithm and a series of experiments are conducted over a set of finished vehicle loading problems. The results demonstrate the proposed approach has superior performance and satisfies users in practice. Contributions of the paper are the modeling and solving of a real complex problem in vehicle manufacturing logistics and a simple branch-and-bound speed up that could be used in other problem classes.