首页|Integrated problem of car sequencing and vehicle routing on an automotive mixed-model assembly line
Integrated problem of car sequencing and vehicle routing on an automotive mixed-model assembly line
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
Elsevier
We address an integrated problem of car sequencing on an automotive mixed-model assembly line and multi-trip vehicle routing for external sync-part supply. The sync-parts, usually characterized by large size and highly customized, are directly delivered from suppliers to the assembly line without intermediate inventory. The goal is to find a joint schedule of car sequencing and vehicle routing so as to minimize the overall makespan. To tackle this intricate problem, we develop a mixed-integer linear programming model by employing the constraint linearization technique. A new meta-heuristic named MS-ALNS-VND is proposed combining multiple start strategy, adaptive large neighborhood search (ALNS) and variable neighborhood descent (VND). Numerical experimental results show that MS-ALNS-VND can solve small-sized instances to optimality in much less running time compared to Gurobi. For medium- and large-sized instances, MS-ALNS-VND outperforms ALNS and VND in both best or average objective values. A case study from an electric automobile manufacturer in China demonstrates the applicability and efficiency of our algorithm.
Multi-trip vehicle routingMixed-model assembly lineSequencingAdaptive large neighborhood searchSync-part supply
Jian Chen、Hong Zhou、Qiang Xue、Naiming Xie、Yao-Wen Sang
展开 >
College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, People's Republic of China
NETL
NSTL
Elsevier
