The static bicycle relocation problem with demand intervals

European Journal of Operational Research

Volumn 238, Issue 2, 2014, Pages 451-457

  Erdoǧan, Güneş ^a   Laporte, Gilbert ^b   Wolfler Calvo, Roberto ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b HEC MONTRÉAL   (Canada)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

Branch and cut; Pickup and delivery; Traveling salesman

Indexed keywords

COSTS; INTEGER PROGRAMMING; SPORTING GOODS; STOCHASTIC PROGRAMMING; TRAVELING SALESMAN PROBLEM;

BENDERS DECOMPOSITION; BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; INTEGER PROGRAMMING FORMULATIONS; LOWER AND UPPER BOUNDS; PICKUP AND DELIVERY; TRAVELING SALESMAN;

BICYCLES;

EID: 84901676951     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.04.013     Document Type: Article

References (16)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network flows: Theory, algorithms, and applications 1993 Prentice Hall New York
2. S. Anily, and R. Hassin The swapping problem Networks 22 1992 419 433
3. M. Benchimol, P. Benchimol, B. Chappert, A.D.L. Taille, F. Laroche, and F. Meunier et al. Balancing the stations of a self service "bike hire" system RAIRO Operations Research 45 2011 37 61
4. 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
5. C. Bordenave, M. Gendreau, and G. Laporte Heuristics for the mixed swapping problem Computers & Operations Research 37 2010 108 114
6. C. Bordenave, M. Gendreau, and G. Laporte A branch-and-cut algorithm for the preemptive swapping problem Networks 59 2012 387 399
7. D. Chemla, F. Meunier, and R. Wolfler Calvo Bike sharing system: Solving the static rebalancing problem Discrete Optimization 10 2013 120 146
8. G. Erdoǧan, J.-F. Cordeau, and G. Laporte A branch-and-cut algorithm for the non-preemptive capacitated swapping problem Discrete Applied Mathematics 158 2010 1599 1614
9. M. Gendreau, G. Laporte, and F. Semet The covering tour problem Operations Research 45 1997 568 576
10. H. Hernández-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
11. H. Hernández-Pérez, and J.-J. Salazar-González The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms Networks 50 2007 258 272
12. R. Nair, and E. Miller-Hooks Equilibrium network design of shared-vehicle systems European Journal of Operational Research 235 1 2014 47 61
13. M.W. Padberg, and G. Rinaldi Facet identification for the symmetric traveling salesman polytope Mathematical Programming 47 1990 219 257
14. M. Rainer-Harbach, P. Papazek, B. Hu, and G.R. Raidl Balancing bicycle sharing systems: A variable neighborhood search approach M. Middendorf, C. Blum, Evolutionary computation in combinatorial optimization Lecture notes in computer science Vol. 7832 2013 Springer Berlin Heidelberg 121 132
15. T. Raviv, M. Tzur, and I.A. Forma Static repositioning in a bike-sharing system: models and solution approaches EURO Journal on Transportation and Logistics 2 3 2013 187 229
16. Schuijbroek, J., Hampshire, R., & van Hoeve, W.-J. (2013). Inventory rebalancing and vehicle routing in bike sharing systems. Tech. Rep. 1491. Pittsburgh, PA 15213: Tepper School of Business, Carnegie Mellon University.