Title
Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
Abstract
Collaborative transportation, as an emerging new mode, represents one of the major developing trends of transportation systems. Focusing on the full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, this paper proposes a mathematical programming model and its corresponding graph theory model, with the objective of minimizing empty vehicle movements. A two-phase greedy algorithm is given to solve practical large-scale problems. In the first phase, a set of directed cycles is created to fulfil the transportation orders. In the second phase, chains that are composed of cycles are generated. Furthermore, a set of local search strategies is put forward to improve the initial results. To evaluate the performance of the proposed algorithms, two lower bounds are developed. Finally, computational experiments on various randomly generated problems are conducted. The results show that the proposed methods are effective and the algorithms can provide reasonable solutions within an acceptable computational time.
Year
DOI
Venue
2010
10.1016/j.cor.2009.08.002
Computers & OR
Keywords
DocType
Volume
acceptable computational time,full truckloads,mathematical programming model,transportation order,carrier collaboration,transportation system,two-phase heuristic algorithm,corresponding graph theory model,empty vehicle movement,computational experiment,capacitated vehicle,proposed algorithm,Collaborative transportation
Journal
37
Issue
ISSN
Citations 
5
Computers and Operations Research
21
PageRank 
References 
Authors
0.76
17
5
Name
Order
Citations
PageRank
Ran Liu1373.81
Z. B. Jiang224236.08
Richard Y. K. Fung344435.21
Feng Chen4271.27
Xiao LIU5598.40