A multi-compartment vehicle routing problem in cold-chain distribution

被引：43

作者：

Chen, Lu ^{[1
]}

Liu, Yang ^{[1
]}

Langevin, Andre ^{[2
,3
]}

机构：

[1] Shanghai Jiao Tong Univ, Sch Mech Engn, Shanghai 200240, Peoples R China

[2] Ecole Polytech Montreal, Montreal, PQ, Canada

[3] CIRRELT, Montreal, PQ, Canada

来源：

COMPUTERS & OPERATIONS RESEARCH | 2019年 / 111卷

关键词：

Vehicle routing problem; Cold-chain distribution; Fuel consumption; Adaptive large neighborhood search algorithm; TABU SEARCH; MEMETIC ALGORITHM; COLLECTION;

D O I：

10.1016/j.cor.2019.06.001

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The vehicle routing problem derived from a real cold-chain distribution company is studied in this paper. It is formulated as a multi-compartment vehicle routing problem with some practical constraints. A mathematical model is provided and an adaptive large neighborhood search (ALNS) algorithm is developed to solve the real-world problems. The computational experiments demonstrate the effectiveness and efficiency of the ALNS algorithm compared with the manual method based mostly on experience. In addition, a sensitivity analysis provides valuable managerial insights for the decision-makers. Crown Copyright (C) 2019 Published by Elsevier Ltd. All rights reserved.

引用

页码：58 / 66

页数：9