Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

Computers and Operations Research

Volumn 37, Issue 5, 2010, Pages 950-959

  Liu, Ran ^a   Jiang, Zhibin ^a   Fung, Richard Y K ^b   Chen, Feng ^a   Liu, Xiao ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Collaborative transportation; Full truckloads; Heuristic; Lower bound; Multi depot

Indexed keywords

COLLABORATIVE TRANSPORTATION; FULL TRUCKLOADS; HEURISTIC; LOWER BOUND; MULTI-DEPOT;

CONTROL THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; SET THEORY;

ROUTING ALGORITHMS;

EID: 70350621876     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.08.002     Document Type: Article

References (25)

1. Ergun O., Kuyzu G., and Savelsbergh M. Shipper collaboration. Computers & Operations Research 34 6 (2007) 1551-1560
2. Arunapuram S., Mathur K., and Solow D. Vehicle routing and scheduling with full truckloads. Transportation Science 37 2 (2003) 170-182
3. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 3 (1981) 305-315
4. Eglese R.W., and Murdock H. Routeing road sweepers in a rural area. Journal of the Operational Research Society 42 4 (1991) 281-288
5. Eiselt H., Gendreau M., and Laporte G. Arc routing problems, part II: the rural postman problem. Operations Research 43 3 (1995) 399-414
6. Assad A.A., and Golden B.L. Arc routing methods and applications. In: Ball M.O., et al. (Ed). Handbooks in operations research and management science, vol. 8 (1995), Elsevier, Amsterdam 375-483
7. Hirabayashi R., Saruwatari Y., and Nishida N. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific Journal of Operational Research 9 2 (1992) 155-175
8. Belenguer J.M., and Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Computers & Operations Research 30 5 (2003) 705-728
9. Longo H., De Aragão M.P., and Uchoa E. Solving capacitated arc routing problem using a transformation to the CVRP. Computers & Operations Research 33 6 (2006) 1823-1837
10. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 1 (2006) 52-60
11. In: Dror M. (Ed). Arc routing: theory, solutions and applications (2000), Kluwer, Boston
12. Hertz A., and Mittaz M. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science 35 4 (2001) 425-434
13. Muyldermans L., Beullens P., Cattrysse D., and Oudheusden V.D. Exploring variants of 2-opt and 3-opt for the general routing problem. Operations Research 53 6 (2005) 982-995
14. Hertz A., Laporte G., and Hugo P.N. Improvement procedures for the undirected rural postman problem. INFORMS Journal on Computing 11 1 (1999) 53-62
15. Beullens P., Muyldermans L., Cattrysse D., and Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147 3 (2003) 629-643
16. Lacomme P., Prins C., and Ramdane-Cherif W. Competitive memetic algorithms for arc routing problems. Annals of Operations Research 131 1 (2004) 159-185
17. Eglese R.W., and Li L.Y.O. A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In: Osman I.H., and Kelly J.P. (Eds). Meta-heuristics: theory and applications (1996), Kluwer, Dordrecht 633-650
18. Brandão J., and Eglese R.W. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35 4 (2008) 1112-1126
19. Greistorfer P. A tabu scatter search metaheuristic for the arc routing problem. Computers & Industrial Engineering 44 2 (2003) 249-266
20. Eglese R.W. Routing winter gritting vehicles. Discrete Applied Mathematics 48 3 (1994) 231-244
21. Amberg A., Domschke W., and Voß S. Multiple center capacitated arc routing problems: a tabu search algorithm using capacitated trees. European Journal of Operational Research 124 2 (2000) 360-376
22. Dantzig G., Fulkerson R., and Johnson S. Solution of a large-scale traveling salesman problem. Operations Research 2 1 (1954) 393-410
23. Toth P., and Vigo D. Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123 1 (2002) 487-512
24. Gronalt M., Hartl R.F., and Reimann M. New savings based algorithms for time constrained pickup and delivery of full truckloads. European Journal of Operational Research 151 3 (2003) 520-535
25. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118