Exact algorithms for the clustered vehicle routing problem

Operations Research

Volumn 62, Issue 1, 2014, Pages 58-71

  Battarra, Maria ^a   Erdoǧan, Güneş ^a   Vigo, Daniele ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and cut; Clusters; Vehicle routing

Indexed keywords

BRANCH AND CUT; BRANCH AND CUT AND PRICES; CAPACITATED VEHICLE ROUTING PROBLEM; CLUSTERS; COMPUTATIONAL PERFORMANCE; INTEGER PROGRAMMING FORMULATIONS; SOLID WASTE COLLECTION; VEHICLE ROUTING PROBLEMS;

BENCHMARKING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; NETWORK ROUTING; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; SALES; VEHICLE ROUTING;

ALGORITHMS;

EID: 84896879959     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2013.1227     Document Type: Article

References (19)

1. Achuthan NR, Caccetta L, Hill SP (1998) Capacitated vehicle routing problem: Some new cutting planes. Asia Pacific J. Oper. Res. 15(1): 109-123.
2. Applegate D, Bixby R, Chvátal V, Cook W (2001) Concorde TSP solver. http://www.tsp.gatech.edu/concorde/index.html.
3. Augerat P (1995) Approche polyedrale du probleme de tournees de vehicules. Ph.D. thesis, Institut National Polytechnique de Grenoble, Grenoble, France.
4. Barthélemy T, Rossi A, Sevaux M, Sorensen K (2010) Metaheuristic approach for the clustered VRP. Presentation, EU/ME 2010 10th Anniversary of the Metaheuristic Community, Lorient, France.
5. Bektaş T, Erdogan G, Ropke S (2011) Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transportation Sci. 45(3):299-316.
6. Bodin L, Maniezzo V, Mingozzi A (2003) Street routing and scheduling problems. Hall RW, ed. Handbook of Transportation Science, International Series in Operations Research and Management Science, Vol. 56 (Kluwer, Dordrecht, The Netherlands), 413-449.
7. Fischetti M, Salazar-González J-J, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3):378-394.
8. Golden BL, Raghavan S, Wasil EA, eds. (2008) The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York).
9. Golden BL, Wasil EA, Kelly JP, Chao I-M (1998) Metaheuristics in vehicle routing. Cranic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer Academic Publishers, Boston), 33-56.
10. Letchford AN, Eglese RW, Lysgaard J (2002) Multistars, partial multistars and the capacitated vehicle routing problem. Math. Programming 94(1): 21-40.
11. Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Working Paper 03-04, Department of Management Science and Logistics, Aarhus University, School of Business, Aarhus, Denmark.
12. Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423-445.
13. Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, Hoboken, NJ).
14. Poot A, Kant G, Wagelmans APM (2002) A savings based method for real-life vehicle routing problems. J. Oper. Res. Soc. 53(1):57-68.
15. Pop PC, Kara I, Horvat-Marc A (2012) New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36(1):97-107.
16. Sahoo S, Kim S, Kim B-I, Kraas B, Popov A Jr (2005) Routing optimization for waste management. Interfaces 35(1):24-36.
17. Sevaux M, Sorensen K (2008) Hamiltonian paths in large clustered routing problems. Proc. EU/MEeting 2008 Workshop on Metaheuristics for Logist. Vehicle Routing, Troyes, France.
18. Sorensen K, Van den Bergh J, Cattrysse D, Sevaux M (2008) A multiobjective distribution problem for parcel delivery at TNT. Invited talk, International Workshop on Vehicle Routing in Practice, VIP'08, Oslo, Norway.
19. Toth P, Vigo D (2001) The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia).