Bike sharing systems: Solving the static rebalancing problem

Discrete Optimization

Volumn 10, Issue 2, 2013, Pages 120-146

  Chemla, Daniel ^a,b   Meunier, Frédéric ^a   Wolfler Calvo, Roberto ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

Branch and cut; Complexity; Local search; Relaxation; Routing

Indexed keywords

BRANCH-AND-CUT; COMPLEXITY; LOCAL SEARCH; RELAXATION; ROUTING;

COMPUTATIONAL COMPLEXITY; OPTIMAL SYSTEMS; TABU SEARCH;

ALGORITHMS;

EID: 84875932501     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2012.11.005     Document Type: Article

References (24)

1. D. Chemla, F. Meunier, R. Wolfler Calvo, Balancing a bike-sharing system with multiple vehicles, in: Odysseus Conference, 2011.
2. M. Benchimol, P. Benchimol, B. Chappert, A. de la Taille, F. Laroche, F. Meunier, and L. Robinet Balancing the stations of a self-service bike hiring system RAIRO Operations Research 45 2011 37 61
3. A. Schrijver Combinatorial Optimization: Polyhedra and Efficiency 2003 Springer
4. B. Korte, and J. Vygen Combinatorial Optimization: Theory and Algorithms second ed. 2002 Springer
5. H. Hernandez Pérez, and J.J. Salazar González A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery Discrete Applied Mathematics 145 2004 126 139
6. S. Anily, and R. Hassin The swapping problem Networks 22 1992 419 433
7. C. Bordenave, and M., G., L. Gendreau A branch-and-cut algorithm for the preemptive swapping problem Networks 59 2008 387 399
8. C. Bordenave, M. Gendreau, and G. Laporte A branch-and-cut algorithm for the non-preemptive swapping problem Naval Research Logistics 56 2009 478 486
9. H. Hernandez Pérez, and J.J. Salazar González Heuristics for the one-commodity pickup-and-delivery traveling salesman problem Transportation Science 38 2004 245 255
10. H. Hernandez Pérez, and J.J. Salazar González The one-commodity pickup-and-delivery travelling salesman problem: inequalities and algorithms Networks 4 2007 258 272
11. H. Hernandez Pérez, I. Rodriguez Martin, and J.J. Salazar González A hybrid grasp/vnd heuristic for the one-commodity pickup-and-delivery traveling salesman problem Computers and Operations Research 36 2009 1639 1645
12. S. Hanafi, A. Ilić, Mladenović, and D. Uroš ević A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem European Journal of Operational Research 220 2012 270 285
13. T. Raviv, M. Tzur, I. Forma, Static repositioning in a bike-sharing system: Models and solution approaches, in: ODYSSEUS, 2009.
14. T. Raviv, M. Tzur, Personal communication, 2011.
15. C. Archetti, M.G. Speranza, and A. Hertz A tabu search algorithm for the split delivery routing problem Transportation Science 40 2006
16. A. Mingozzi, Personal communication, 2010.
17. M. Desrochers, and G. Laporte Improvements and extensions to the miller-tucker-zemlin subtour elimination constraints Operations Research Letters 10 1991 27 36
18. P. Augerat, J.M. Belenguer, E. Benavent, A. Corberan, and D. Naddef Separating capacity constraints in the CVRP using tabu search European Journal of Operational Research 106 1999 546 557
19. H. Hernandez Pérez, and J.J. Salazar González The one-commodity pickup-and-delivery travelling salesman problem Lecture Notes in Computer Science 2570 2002 89 104
20. T. Gallai, Maximum-minimum theorems for networks, Tech. Rep., 1957.
21. J. Edmonds, and R. Karp Theoretical improvements in algorithmic efficiency for network flow problems Journal of the ACM 19 1972 248 264
22. T. Achterberg, T. Koch, and A. Martin Branching rules revisited Operations Research Letters 33 1 2005 42 54
23. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic
24. M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 1994 1276 1290