Advertisement

The Bike Request Scheduling Problem

  • Kenneth Sörensen
  • Nicholas Vergeylen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9520)

Abstract

In this paper we introduce the bike request scheduling problem, a new approach to city bike repositioning problems. The rationale behind this approach is explained, and a mixed-integer programming formulation is given. We prove that the bike request scheduling problem is NP-hard and formulate recommendations for future research.

Keywords

Knapsack Problem Request Generation Bicycle Sharing System Late Arrival Time Realistic Test Case 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Benchimol, M., Benchimol, P., Chappert, B., Taille, A.D.L., Laroche, F., Meunier, F., Robinet, L.: Balancing the stations of a self service bike hire system. RAIRO Oper. Res. 45(1), 37–61 (2011)CrossRefzbMATHGoogle Scholar
  2. Chemla, D., Meunier, F., Calvo, R.W.: Bike sharing system: solving the static rebalancing problem. Discrete Optim. 10, 120–146 (2012). (Accepted for publication in Discrete Optimization)CrossRefzbMATHGoogle Scholar
  3. Contardo, C., Morency, C., Rousseau, L.-M.: Balancing a dynamic public bike-sharing system. Centre Interuniversitaire de Recherche sur les Réseaux d’entreprise, la Logistique et le Transport (2012)Google Scholar
  4. Dasgupta, S., Papadimitriou, C.H., Vazirani, U.: Algorithms, 1st edn. McGraw-Hill Inc, New York (2008)Google Scholar
  5. DeMaio, P.: Bike-sharing: History, impacts, models of provision, and future. J. Public Transp. 12(4), 41–56 (2009)MathSciNetCrossRefGoogle Scholar
  6. Erdoğan, G., Laporte, G., Calvo, R.W.: The one-commodity pickup and delivery traveling salesman problem with demand intervals. Submitted for publication to Transportation Science (2013)Google Scholar
  7. Kloimüllner, C., Papazek, P., Hu, B., Raidl, G.R.: Balancing bicycle sharing systems: an approach for the dynamic case. In: Blum, C., Ochoa, G. (eds.) EvoCOP 2014. LNCS, vol. 8600, pp. 73–84. Springer, Heidelberg (2014) Google Scholar
  8. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990) zbMATHGoogle Scholar
  9. Midgley, P.: Bicycle sharing schemes: enhancing sustainable mobility in urban areas. Background paper CSD19/2011/BP 8, United Nations Department of Economic and Social Affairs, Commission on Sustainable Development (2011)Google Scholar
  10. Pillac, V., Gendreau, M., Guret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 255(1), 1–11 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  11. Rainer-Harbach, M., Papazek, P., Raidl, G.R., Hu, B., Kloimllner, C.: PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. J. Glob. Optim. 63, 1–33 (2014)MathSciNetzbMATHGoogle Scholar
  12. Raviv, T., Tzur, M., Forma, I.A.: Static repositioning in a bike-sharing system: models and solution approaches. EURO J. Transp. Logistics 2, 1–43 (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.University of Antwerp Operations Research Group ANT/ORAntwerpBelgium

Personalised recommendations