A destroy and repair algorithm for the Bike sharing Rebalancing Problem

Computers and Operations Research

Volumn 71, Issue , 2016, Pages 149-162

  Dell'Amico, Mauro ^a   Iori, Manuel ^a   Novellani, Stefano ^a,b   Stützle, Thomas ^c  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Bike sharing; Branch and cut; Destroy and repair; Rebalancing; Speed up techniques

Indexed keywords

BICYCLES; FLEET OPERATIONS; INTEGER PROGRAMMING; REPAIR; VEHICLE ROUTING;

BIKE SHARING; BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; CONSTRUCTIVE HEURISTIC; META HEURISTIC ALGORITHM; REBALANCING; SPEED-UP TECHNIQUES;

ALGORITHMS;

EID: 84959352769     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2016.01.011     Document Type: Article

References (38)

1. P. DeMaio Bike sharing: history, impacts, model of provision and future J Public Transp 10 2009 41 56
2. DeMaio P, Meddin R. Bike-sharing world map. [Online]. Available: 〈http://bike-sharing.blogspot.it/〉; 2014.
3. M. Dell'Amico, E. Hadjicostantinou, M. Iori, and S. Novellani The bike sharing rebalancing problem: mathematical formulations and benchmark instances Omega 45 2014 7 19
4. 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 Discret Appl Math 145 2004 126 139
5. Shi X, Zhao F, Gong Y. Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem. In: IEEE international conference on intelligent computing and intelligent systems, vol. 1, 2009. p. 175-9.
6. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey TOP 15 2007 1 31
7. Battarra M, Cordeau J-F, Iori M. Pickup and delivery problems for goods transportation. In: Toth P, Vigo D, editors. Vehicle routing: problems, methods, and applications, 2nd ed. SIAM, Monographs on discrete mathematics and applications; 2014, pp 161-192.
8. Hernández-Pérez H, Salazar-González J-J. The one-commodity pickup-and-delivery travelling salesman problem. Lecture notes in computer science, vol. 2570/2003, Berlin; Springer; 2003. p. 89-104.
9. 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
10. H. Hernández-Pérez, and J.-J. Salazar-González Heuristics for the one-commodity pickup-and-delivery traveling salesman problem Transp Sci 38 2004 245 255
11. H. Hernández-Pérez, I. Rodríguez-Martín, and J.-J. Salazar-González A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem Comput Oper Res 36 2009 1639 1645
12. G. Martinović, I. Aleksi, and A. Baumgartner Single-commodity vehicle routing problem with pickup and delivery service Math Prob Eng 2008 2008 10.1155/2008/697981 Article ID 697981
13. F. Zhao, S. Li, J. Sun, and D. Mei Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem Comput Ind Eng 56 2009 1642 1648
14. Hosny M, Mumford C. Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach. In: Schaefer R, Cotta C, Kolodziej J, Rudolph G, editors. Parallel problem solving from nature, PPSN XI, Lecture notes in computer science, vol. 6239. Berlin; Springer; 2010. p. 189-98.
15. N. Mladenović, D. Urošević, S. Hanafi, and A. Ilić A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem Eur J Oper Res 220 2012 270 285
16. M. Benchimol, P. Benchimol, B. Chappert, A. De La Taille, F. Laroche, F. Meunier, and et al. Balancing the stations of a self service bike hire system RAIRO-Oper Res 45 2011 37 61
17. D. Chemla, F. Meunier, and R. Wolfler Calvo Bike sharing systems: solving the static rebalancing problem Discret Optim 10 2013 120 146
18. G. Erdoğan, M. Battarra, and R. Wolfler Calvo An exact algorithm for the static rebalancing problem arising in bicycle sharing systems Eur J Oper Res 245 2015 667 679
19. T. Raviv, M. Tzur, and I. Forma Static repositioning in a bike-sharing system: models and solution approaches EURO J Transp Logist 2 2013 187 229
20. Papazek P, Raidl G, Rainer-Harbach M, Hu B. A PILOT/VND/GRASP hybrid for the static balancing of public bicycle sharing systems. In: Computer Aided Systems Theory-EUROCAST 2013. Springer; 2013. p. 372-9.
21. L. Di Gaspero, A. Rendl, and T. Urli Balancing bike sharing systems with constraint programming Constraints 2015 1 31
22. Schuijbroek J, Hampshire R, van Hoeve W-J. Inventory rebalancing and vehicle routing in bike sharing systems. Tepper School of Business, Carnegie Mellon University, Working Paper; 2013.
23. Contardo C, Morency C, Rousseau L-M. Balancing a dynamic public bike-sharing system, CIRRELT. Technical Report, CIRRELT-2012-09; 2012.
24. Ö Ergun, and J.B. Orlin Fast neighborhood search for the single machine total weighted tardiness problem Oper Res Lett 34 2006 41 45
25. C.-J. Liao, H.-H. Tsou, and K.-L. Huang Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups Theor Comput Sci 434 2012 45 52
26. T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithms for routing and scheduling problems with general time-window constraints Transp Sci 39 2005 206 232
27. S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transp Sci 40 2006 455 472
28. L.W. Jacobs, and M.J. Brusco A local search heuristic for large set-covering problems Nav Res Logist 42 1995 1129 1140
29. G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck Record breaking optimization results using the ruin and recreate principle J Comput Phys 159 2000 139 171
30. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher MJ, Puget, J-F, editors. Principles and practice of constraint programming - CP98. Lecture notes in computer science, vol. 1520. Springer, 1998. p. 417-31.
31. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem Eur J Oper Res 177 2007 2033 2049
32. A.J. Richmond, and J.E. Beasley An iterative construction heuristic for the ore selection problem J Heuristics 10 2004 153 167
33. Cesta A, Oddi A, Smith SF. Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: Proceedings of the seventeenth national conference on artificial intelligence. AAAI Press/The MIT Press; 2000. p. 742-7.
34. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper Res 12 1964 568 581
35. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications Eur J Oper Res 130 2001 449 467
36. den Besten M, Stützle T. Neighborhoods revisited: an experimental investigation into the effectiveness of variable neighborhood descent for scheduling. In: Proceedings of the 4th metaheuristics international conference, vol. 2, Porto, Portugal; July 2001. p. 545-50.
37. Dell'Amico M, Iori M, Novellani S, Stützle T. New real-world instances for the bike sharing rebalancing problem. [Online]. Available: 〈http://www.or.unimore.it/resources/BRP2/instances.html〉; 2015.
38. López-Ibáñez M, Dubois-Lacoste J, Stützle T, Birattari M. The irace package, iterated race for automatic algorithm configuration. Technical Report, IRIDIA, Université Libre de Bruxelles, Belgium, TR/IRIDIA/2011-004; 2011. [Online]. Available: 〈http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2011-004.pdf〉.