Approximation algorithms for capacitated location routing

Transportation Science

Volumn 47, Issue 1, 2013, Pages 3-22

  Harks, Tobias ^a   König, Felix G ^b   Matuschke, Jannik ^c  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b TomTom International BV ^*  (Germany)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Capacitated location routing; Cross docking; Vehicle routing

Indexed keywords

BENCHMARKING; LOCATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

APPROXIMATION FACTOR; CAPACITATED LOCATION; CAPACITATED VEHICLES; COMPUTATIONAL STUDIES; CROSSDOCKING; LOCATION-ROUTING; OPTIMIZATION PROBLEMS; PRIZE-COLLECTING;

APPROXIMATION ALGORITHMS;

EID: 84873588266     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0423     Document Type: Article

References (47)

1. Arora S, Raghavan P, Rao S (1998) Approximation schemes for Euclidean k-medians and related problems. STOC '98 (Association for Computing Machinery, New York), 106-113.
2. Baldacci R, Mingozzi A, Wolfer-Calvo R (2009) The capacitated location routing problem. Presented at ROUTE 2009, Rolighed, Denmark.
3. Baldacci R, Toth P, Vigo D (2010) Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1):213-245.
4. Barreto S, Ferreira C, Paixão J, Santos BS (2007) Using clustering analysis in a capacitated location routing problem. Eur. J. Oper. Res. 179(3):968-977. (Pubitemid 46038597)
5. Belenguer J-M, Benavent E, Prins C, Prodhon C, Calvo RW (2011) A branch-and-cut method for the capacitated location-routing problem. Comput. OR 38(6):931-941.
6. Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Sci. 39(1):104-118. (Pubitemid 40466664)
7. Byrka J, Aardal K (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39(6):2212-2231.
8. Cardon S, Dommers E, Eksin C, Sitters R, Stougie L (2008) A PTAS for the multiple depot vehicle routing problem. SPOR Report 2008-03, Technische Universiteit Eindhoven, Eindhoven, The Netherlands.
9. Charikar M, Khuller S, Raghavachari B (2001) Algorithms for capacitated vehicle routing. SIAM J. Comput. 31(3):665-682. (Pubitemid 34750550)
10. Charikar M, Khuller S, Mount DM, Narasimhan G (2001) Algorithms for facility location problems with outliers. SODA '01 (Society for Industrial and Applied Mathematics, Philadelphia), 642-651.
11. Chen X, Chen B (2009) Cost-effective designs of fault-tolerant access networks in communication systems. Networks 53(4):382-391.
12. Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
13. Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1):1-25.
14. Contardo C, Cordeau J-F, Gendron B (2010) A branch-and-cut algorithm for the capactiated location problem. http:// claudiocontardo.org/wp-content/ uploads/2011/07/CIRRELT- 2011-44.pdf.
15. Cordeau JF, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. Barnhart C, Laporte G, eds. Transportation of Handbooks in Operations Research and Management Science, Vol. 14. (Elsevier, Amsterdam), 367-428.
16. Cordeau JF, Gendreau M, Laporte G, Potvin JY, Semet F (2002) A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53:512-522. (Pubitemid 34550664)
17. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to Algorithms (MIT Press, Cambridge, MA).
18. Desrochers M, Lenstra JK, Savelsbergh MWP, Soumis F (1988) Vehicle routing with time windows: Optimization and approximation. Golden BL, Assad AA, eds. Vehicle Routing: Methods and Studies (North-Holland, Amsterdam), 65-84.
19. Feige U (1998) A threshold of ln n for approximating set cover. J. ACM 45(4):634-652. (Pubitemid 128488790)
20. Glicksman H, Penn M (2008) Approximation algorithms for group prize-collecting and location-routing problems. Discrete Appl. Math. 156(17):3238-3247.
21. Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2):296-317.
22. Golden BL, Assad AA, eds. (1988) Vehicle Routing: Methods and Studies (North-Holland, Amsterdam).
23. Golden B, Wong R (1981) Capacitated arc routing problems. Networks 11(3):305-315.
24. Haimovich M, Rinnoy Kan AHG (1985) Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4):527-542. (Pubitemid 15600819)
25. Haimovich M, Rinnoy Kan AHG, Stougie L (1988) Analysis of heuristics for vehicle routing problems. Golden BL, Assad AA, eds. Vehicle Routing: Methods and Studies (North-Holland, Amsterdam), 47-61.
26. Helsgaun K (2000) An effective implementation of the Lin- Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1):106-130.
27. Hochbaum DS (1997) Approximation Algorithms for NP-Hard Problems (PWS Publishing, Boston).
28. IBM Corp (2009) IBM ILOG CPLEX Optimizer 12.1.0. http:// www.ibm.com/software/integration/optimization/cplex -optimizer/.
29. Jain K, Mahdian M, Markakis E, Saberi A, Vazirani VV (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6):795-824.
30. Laporte G (1988) Location-routing problems. Golden BL, Assad AA, eds. Vehicle Routing: Methods and Studies (North-Holland, Amsterdam), 163-198.
31. Laporte G (2009) Fifty years of vehicle routing. Transportation Sci. 43(4):408-416.
32. Laporte G, Semet F (2001) Classical heuristics for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia), 109-128.
33. Laporte G, Nobert Y, Taillefer S (1988) Solving a family of multidepot vehicle routing and location-routing problems. Transportation Sci. 22(3):161-172. (Pubitemid 18654114)
34. Li C, Simchi-Levi D (1990) Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems. ORSA J. Comput. 2(1):64-73.
35. Liu J, Li C-L, Chan C-Y (2003) Mixed truck delivery systems with both hub-and-spoke and direct shipment. Transportation Res. Part E: Logist. Transportation Rev. 39(4):325-339. (Pubitemid 36685005)
36. Mahdian M, Ye Y, Zhang J (2006) Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2):411-432. (Pubitemid 46627294)
37. Mina H, Jayaraman V, Srivastava R (1998) Combined locationrouting problems: A synthesis and future research directions. Eur. J. Oper. Res. 108(1):1-15. (Pubitemid 128372582)
38. Nagy G, Salhi S (2007) Location-routing: Issues, models, and methods. Eur. J. Oper. Res. 177(2):649-672.
39. Prins C, Prodhon C, Calvo RW (2006) Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR-Q. J. Oper. Res. 4(3): 221-238.
40. Prins C, Prodhon C, Ruiz AB, Soriano P, Calvo RW (2007) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Sci. 41(4):470-483.
41. Ravi R, Sinha A (2006) Approximation algorithms for problems combining facility location and network design. Oper. Res. 54(1):73-81.
42. Toth P, Vigo D (2002) The Vehicle Routing Problem (Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia).
43. Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116(1):87-99.
44. Vahdani B, Zandieh M (2010) Scheduling trucks in crossdocking systems: Robust meta-heuristics. Comput. Indust. Engrg. 58(1):12-24.
45. Webb MHJ (1968) Cost functions in the location of depots for multiple-delivery journeys. Oper. Res. Quart. 19:311-320.
46. Wen M, Larsen J, Clausen J, Cordeau J-F, Laporte G (2009) Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(11):1708-1718.
47. Williamson D, Shmoys D (2011) The Design of Approximation Algorithms (Cambridge University Press, Cambridge, UK).