Two-stage heuristic algorithm for multi-depot vehicle routing problem with time windows

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice

Volumn 32, Issue 8, 2012, Pages 1793-1800

  Yu, Bin ^a   Jin, Peng Huan ^a   Yang, Zhong Zhen ^a  

^a DALIAN MARITIME UNIVERSITY   (China)

Author keywords

Aggregation; Ant colony optimization; Clustering algorithm; Multi depot vehicle routing problem with time window

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); ANT-WEIGHT STRATEGY; CROSSOVER OPERATIONS; MDVRPTW; TIME WINDOWS; TWO-STAGE HEURISTIC ALGORITHMS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

AGGLOMERATION; ARTIFICIAL INTELLIGENCE; CLUSTERING ALGORITHMS; HEURISTIC ALGORITHMS; NETWORK ROUTING; ROUTING ALGORITHMS;

VEHICLE ROUTING;

EID: 84867420662     PISSN: 10006788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. Polacek M R, Hartl R F, Doerner K, et al. A variable neighborhood search for the multi depot vehicle routing problem with time windows[J]. Journal of Heuristics, 2004, 10(6): 613-627.
2. Cordeau J F, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2001, 52(8): 928-936.
3. Cordeau J F, Laporte G, Mercier A. An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2004, 55(5): 542-546.
4. Renaud J, Laporte G, Boctor F F. A tabu search heuristic for the multi-depot vehicle routing problem[J]. Computers and Operations Research, 1996, 23(3): 229-235.
5. Cordeau J F, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems[J]. Networks, 1997, 30: 105-119.
6. Chao M I, Golden B L, Wasil E A. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions[J]. Am J Math Mgmt Sci, 1993, 13: 371-406.
7. Christofides N, Eilon S. An algorithm for one vehicle-dispatching problem[J]. Opl Res Q, 1969, 20: 309-318.
8. Gillett B E, Johnson J G. Multi-terminal vehicle-dispatch algorithm[J]. Omega, 1976(4): 711-718.
9. Crevier B, Cordeau J F, Laporte G. The multi-depot vehicle routing problem with inter-depot routes[J]. European Journal of Operational Research, 2007, 76(2): 756-773.
10. Wang P, Tang X P, Li Y. Approach for a multi-source logistics delivery optimum model[J]. Systems Engineering-Theory & Practice, 2003, 23(3): 87-91.
11. Li Z, Lei D Y. Model and algorithm of multiple depot transit vehicle scheduling[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 83-86.
12. Li M, Guo Q, Liu H L. Multiple depot multi-logistics center distribution problem[J]. Computer Engineering and Applications, 2007, 43(8): 202-204, 208.
13. Li X Y, Tian P. Vehicle routing problems with time windows and stochastic times: Models & algorithm[J]. Systems Engineering-Theory & Practice, 2009, 29(8): 81-90.
14. Ding Q L, Hu X P, Li Y X. A hybrid ant colony system for vehicle routing problem with time windows[J]. Systems Engineering-Theory & Practice, 2007, 27(10): 98-104.
15. Zhong S Q, Ma S F. Improved branch and cut algorithm for vehicle routing problem[J]. Systems Engineering-Theory & Practice, 2009, 29(10): 152-158.
16. Dorigo M, Maniezzo V, Colorni A. The ant system: Optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems, Mans, and Cybernetics, 1996, 26(1): 29-41.
17. Yu B, Yang Z Z, Yao B Z. An improved ant colony optimization for vehicle routing problem[J]. European Journal of Operational, 2009, 196(1): 171-176.
18. Bullnheimer B, Hartl R F, Strauss C. An improved ant system algorithm for the vehicle routing problem[J]. Annals of Operations Research, 1999, 89: 319-328.