The bike sharing rebalancing problem: Mathematical formulations and benchmark instances

Omega (United Kingdom)

Volumn 45, Issue , 2014, Pages 7-19

  Dell'Amico, Mauro ^a   Hadjicostantinou, Eleni ^b,c   Iori, Manuel ^a   Novellani, Stefano ^a,d  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c FREDERICK UNIVERSITY   (Cyprus)

^d UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Integer programming; Routing; Traveling salesman; Vehicle scheduling

Indexed keywords

BENCHMARKING; BICYCLES; CONSTRAINT PROGRAMMING; FLEET OPERATIONS; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

BRANCH-AND-CUT ALGORITHMS; INTEGER PROGRAM- MING; MATHEMATICAL FORMULATION; MOBILITY SERVICE; PUBLIC BICYCLES; REBALANCING; ROUTINGS; SHARING SYSTEMS; TRAVELLING SALESMAN; VEHICLE SCHEDULING;

INTEGER PROGRAMMING;

EID: 84892866628     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2013.12.001     Document Type: Article

References (34)

1. DeMaio P. Bike sharing. history, impacts, model of provision and future. Journal of Public Transportation 2009, 10:41-56.
2. OBIS Project. Optimising bike sharing in European cities. A handbook, 2011.
3. Pucher J., Buehler R., Seinen M. Bicycling renaissance in North America? An update and re-appraisal of cycling trends and policies. Transportation Research Part A 2011, 45:451-475.
4. Shaheen S., Guzman S., Zhang H. Bikesharing in Europe, the Americas, and Asia. past, present, and future. Transportation Research Record 2010, 2143:159-167.
5. Kaltenbrunner A., Meza R., Grivolla J., Codina J., Banchs R. Urban cycles and mobility patterns. exploring and predicting trends in a bicycle-based public transport system. Pervasive and Mobile Computing 2010, 6:455-466.
6. Vogel P, Mattfeld D. Modeling of repositioning activities in bike-sharing systems. In: 12th WCTR, Lisbon, Portugal, 2010. p. 1-13.
7. Lin J.-R., Yang T. Strategic design of public bicycle sharing systems with service level constraints. Transportation Research Part E 2011, 47:284-294.
8. Souffriau W., Vansteenwegen P., Vanden Berghe G., Van Oudheusden D. The planning of cycle trips in the province of East Flanders. Omega 2011, 39:209-213.
9. Boctor F., Renaud J., Cornillier F. Trip packing in petrol stations replenishment. Omega 2011, 39:86-98.
10. Berbeglia G., Cordeau J.-F., Gribkovskaia I., Laporte G. Static pickup and delivery problems. a classification scheme and survey. TOP 2007, 15:1-31.
11. Parragh S.N., Doerner K.F., Hartl R.F. A survey on pickup and delivery problems. Part I. transportation between customers and depot. Journal für Betriebswirtschaft 2008, 58:21-51.
12. Parragh S.N., Doerner K.F., Hart l.R.F. A survey on pickup and delivery problems. Part II. transportation between pickup and delivery locations. Journal für Betriebswirtschaft 2008, 58:81-117.
13. Battarra M, Cordeau J-F, Iori M. Pickup and delivery problems for goods transportation. Technical Report, University of Modena and Reggio Emilia, Italy; 2012.
14. Doerner K, Salazar-González J-J. Pickup and delivery routing problems for people transportation. Technical Report, University of La Laguna, Spain; 2012.
15. Hernández-Pérez H., Salazar-González J.-J. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics 2004, 145:126-139.
16. Hernández-Pérez H., Salazar-González J.-J. The one-commodity pickup-and-delivery traveling salesman problem. inequalities and algorithms. Networks 2007, 50:258-272.
17. Hernández-Pérez H., Salazar-González J.-J. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 2004, 38:245-255.
18. Hernández-Pérez H., Rodríguez-Martín I., Salazar-González J.-J. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research 2009, 36:1639-1645.
19. Wang F., Lim A., Xu Z. The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 2006, 48:24-35.
20. Martinovic G., Aleksi I., Baumgartner A. Single-commodity vehicle routing problem with pickup and delivery service. Mathematical Problems in Engineering 2008, Article ID 697981.
21. Zhao F., Li S., Sun J., Mei D. Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Industrial Engineering 2009, 56:1642-1648.
22. Hosny M., Mumford C. Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach. Parallel problem solving from nature, PPSN XI. Lecture notes in computer science 2010, vol. 6239:189-198. Springer, Berlin.
23. Mladenović N., Urošević D., Hanafi S., Ilić A. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research 2012, 220:270-285.
24. 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.
25. Benchimol M., Benchimol P., Chappert B., De La Taille A., Laroche F., Meunier F., et al. Balancing the stations of a self service "Bike Hire" system. RAIRO-Operations Research 2011, 45:37-61.
26. Chemla D., Meunier F., Wolfler Calvo R. Bike sharing systems. solving the static rebalancing problem. Discrete Optimization 2013, 10:120-146.
27. Raviv T., Tzur M., Forma IA. Static repositioning in a bike-sharing system: models and solution approaches. EURO Journal of Transportation and Logistics 2013, 2:187-229.
28. Contardo C, Morency C, Rousseau L-M. Balancing a dynamic public bike-sharing system. Technical Report CIRRELT-2012-09, CIRRELT; 2012.
29. Bektas T. The multiple traveling salesman problem. an overview of formulations and solution procedures. Omega 2006, 34:209-219.
30. The traveling salesman and its variations 2002, Kluwer, Dordrecht. G. Gutin, A. Punnen (Eds.).
31. Miller C., Tucker A., Zemlin R. Integer programming formulations and traveling salesman problems. Journal of the Association of Computing Machinery 1960, 7:326-329.
32. Baldacci R., Hadjiconstantinou E., Mingozzi A. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 2004, 52:723-738.
33. Ascheuer N., Fischetti M., Grötschel M. A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks 2000, 36:69-79.
34. Toth P., Vigo D. The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia, USA 2002.