Balancing the stations of a self service "bike hire" system

RAIRO - Operations Research

Volumn 45, Issue 1, 2011, Pages 37-61

  Benchimol, Mike ^a   Benchimol, Pascal ^b   Chappert, Benoît ^a   De La Taille, Arnaud ^a   Laroche, Fabien ^b   Meunier, Frédéric ^a   Robinet, Ludovic ^a  

^a UNIVERSITÉ PARIS EST   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

Approximation algorithm; Routing problem; Self service transport system

Indexed keywords

COMPLEXITY RESULTS; GRAPH G; LOWER BOUNDS; POLYNOMIAL ALGORITHM; ROUTING PROBLEMS; TRANSPORT SYSTEMS;

AUTOMOBILES; BICYCLES; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 79959650782     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/2011102     Document Type: Article

References (12)

1. S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Nav. Res. Logist. (1997).
2. S. Anily and R. Hassin, The swapping problem. Networks 22 (1992) 419-433.
3. P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán and D. Naddef, Seprating capacity constraints in the CRVP using tabu search. Eur. J. Oper. Res. 106 (1998) 546-557. (Pubitemid 128399668)
4. P. Chalasani and R. Motwani, Approximating capacited routing and delivery problem. SIAM J. Comput. 28 (1999) 2133-2149. (Pubitemid 30530995)
5. M. Charikar, S. Khuller and B. Raghavachari, Algorithms for capacitated vehicle routing. SIAM J. Comput. 31 (2001) 665-682. (Pubitemid 34750550)
6. N. Christofides, Worst-case analysis for a new heuristic for the Traveling Salesman problem, in Symposium on New Directions and Recent Results in Algorithms and Complexity, edited by J.F. Traub, Academic Press (1976).
7. M.R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of NP-completness. W.H. Freeman (1979).
8. H. Hernández-Pérz and J.-J. Salazar-González, The one-commodity pickup-and-delivery travelling salesman problem, in Lect. Notes Comput. Sci. 2570 (2002) 89-104. (Pubitemid 36317150)
9. H. Hernández-Pérz and J.-J. Salazar-González, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discr. Appl. Math. 145 (2004) 126-139.
10. J.A. Hoogeveen, Analysis of christofides'heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10 (1991) 291-295.
11. D. König, Uber Graphen und ihre Anwendung auf Determinantentheorie une Mengenlehre. Math. Ann. 77 (1916) 453-465.
12. A. Lim, F. Wang and Z. Xu, The capacitated traveling salesman problem with pickups and deliveries on a tree, in Lect. Notes Comput. Sci. Algorithms and Computation. Springer Berlin/Heidelberg 3827 (2005) 1061-1070. (Pubitemid 43856331)