Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7919 LNCS, Issue , 2013, Pages 130-143

  Raidl, Günther R ^a   Hu, Bin ^a   Rainer Harbach, Marian ^a   Papazek, Petrina ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BICYCLE SHARING; INDIVIDUAL TRAFFIC; LOADING OPERATIONS; NEIGHBORHOOD STRUCTURE; OPTIMAL LOADING; SHARING SYSTEMS; USER SATISFACTION; VARIABLE NEIGHBORHOOD SEARCH;

BICYCLES; HEURISTIC ALGORITHMS; OPTIMIZATION;

LOADING;

EID: 84883027660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38516-2_11     Document Type: Conference Paper

References (11)

1. DeMaio, P.: Bike-sharing: History, impacts, models of provision, and future. Journal of Public Transportation 12(4), 41-56 (2009)
2. Chemla, D., Meunier, F., Calvo, R.W.: Bike sharing systems: Solving the static rebalancing problem. Discrete Optimization 10(2), 120-146 (2013)
3. Benchimol, M., Benchimol, P., Chappert, B., De la Taille, A., Laroche, F., Meunier, F., Robinet, L.: Balancing the stations of a self service bike hire system. RAIRO - Operations Research 45(1), 37-61 (2011)
4. Raviv, T., Tzur, M., Forma, I.A.: Static repositioning in a bike-sharing system: models and solution approaches. EURO Journal on Transportation and Logistics, 1-43 (2013)
5. Contardo, C., Morency, C., Rousseau, L.M.: Balancing a Dynamic Public Bike-Sharing System. Technical Report CIRRELT-2012-09, CIRRELT, Montreal, Canada, submitted to Transportation Science (2012)
6. Schuijbroek, J., Hampshire, R., van Hoeve, W.J.: Inventory Rebalancing and Vehicle Routing in Bike Sharing Systems. Technical Report 2013-E1, Tepper School of Business, Carnegie Mellon University (2013)
7. Rainer-Harbach, M., Papazek, P., Hu, B., Raidl, G.R.: Balancing bicycle sharing systems: A variable neighborhood search approach. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 121-132. Springer, Heidelberg (2013)
8. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24(11), 1097-1100 (1997)
9. Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Prodhon, C., Wolfler-Calvo, R., Labadi, N., Prins, C. (eds.) Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)
10. Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219-249. Kluwer Academic Publishers (2003)
11. Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390-410 (1997)