Abstract
In a carsharing system, a fleet of cars is distributed at stations in an urban area, customers can take and return cars at any time and station. For operating such a system in a satisfactory way, the stations have to keep a good ratio between the total number of places and cars in each station, in order to refuse as few customer requests as possible. This leads to the problem of relocating cars between stations, which can be modeled by means of coupled flows of cars in convoys in a time-expanded network. We present an integer programming formulation for a max-profit flow problem to balance the profit of accepted customer requests against the cost for relocation. This enables us to compute optimal offline solutions only since the computation times are too high for the online situation. We, therefore, devise a heuristic approach based on the flow formulation and show experimentally that it computes reasonable solutions in short time, so that it suits for the online situation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.): Network Models. Handbooks in Operations Research and Management Science, vol. 7. Elsevier Science B.V., Amsterdam (1995)
Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.): Network Routing. Handbooks in Operations Research and Management Science, vol. 8. Elsevier Science B.V., Amsterdam (1995)
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, 37–61 (2011)
Chemla, D., Meunier, F., Calvo, R.W.: Bike sharing systems: Solving the static rebalancing problem. Discrete Optimization, 120–146 (2013)
Krumke, S.O., Quilliot, A., Wagler, A.K., Wegener, J.-T.: (2014), http://www.mathematik.uni-kl.de/opt/mitglieder/krumke/research/
Contardo, C., Morency, C., Rousseau, L.-M.: Balancing a dynamic public bike-sharing system. Technical Report 9, CIRRELT (2012), https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2012-09.pdf
EL-Zaher, M., Dafflon, B., Gechter, F., Contet, J.-M.: Vehicle Platoon Control with Multi-Configuration Ability. Procedia Computer Science 9, 1503–1512 (2012)
Groß, M., Skutella, M.: Generalized maximum flows over time. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 247–260. Springer, Heidelberg (2012)
Hamacher, H.W., Tjandra, S.: Earliest arrival flow with time dependent capacity for solving evacuation problems. In: Pedestrian and Evacuation Dynamics, pp. 267–276. Springer (2002)
Koch, R., Nasrabadi, E., Skutella, M.: Continuous and discrete flows over time. Mathematical Methods of Operations Research 73(3), 301–337 (2011)
Krumke, S.O., Quilliot, A., Wagler, A.K., Wegener, J.-T.: Models and algorithms for carsharing systems and related problems. Electronic Notes in Discrete Mathematics 44(0), 201–206 (2013)
Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.): Optimization. Handbooks in Operations Research and Management Science, vol. 1. Elsevier Science B.V., Amsterdam (1989)
Schuijbroek, J., Hampshire, R., van Hoeve, W.-J.: Inventory rebalancing and vehicle routing in bike sharing systems. Working paper (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Krumke, S.O., Quilliot, A., Wagler, A.K., Wegener, JT. (2014). Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-07959-2_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07958-5
Online ISBN: 978-3-319-07959-2
eBook Packages: Computer ScienceComputer Science (R0)