The multi-temperature refrigerated container is a bran-new technique, which can be setup on different temperatures, and preserve goods from losing temperature within almost 24 hours. Consequently, carriers can utilize such a container to hold and deliver different temperature goods to customers in general trucks. This paper formulates the above situation to the Multi-temperature Refrigerated Container Vehicle Routing Problem (MRCVRP), and proposes a two-stage heuristic which consists of modified savings algorithms to construct the initial solution and improve it by sequentially executing four interchange heuristics. To compare the performance of the MRCVRP with that of the classical VRP, a bank of 60 instances, modified from the Solomon's VRPTW benchmark instances, is adopted. Computational results reveal that MRCVRP generates significantly lower routing distance than VRP. Such a finding identifies that the MRCVRP could offer an effective and efficient alternative to improve the performance of multi-temperate fresh-keeping delivery service and cold logistics.
[1]
Bruce L. Golden,et al.
The fleet size and mix vehicle routing problem
,
1984,
Comput. Oper. Res..
[2]
Nicos Christofides,et al.
An Algorithm for the Vehicle-dispatching Problem
,
1969
.
[3]
G. Clarke,et al.
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
,
1964
.
[4]
Marius Mihai Solomon,et al.
VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOW CONSTRAINTS: MODELS AND ALGORITHMS (HEURISTICS)
,
1984
.
[5]
Christos D. Tarantilis,et al.
A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
,
2004,
Eur. J. Oper. Res..