Optimizing relocation operations in electric car-sharing

• Published in: Omega (Oxford) Vol. 81; pp. 234 - 245
• Main Authors: Gambella, Claudio, Malaguti, Enrico, Masini, Filippo, Vigo, Daniele
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.12.2018
• Subjects: Computational experiments; Electric car-sharing; Heuristic algorithms; Mathematical models; Operations; Relocation; Electric car-sharing; Computational experiments; Mathematical models; Heuristic algorithms; Relocation; Operations
• ISSN: 0305-0483; 1873-5274
• DOI: 10.1016/j.omega.2017.11.007

•We introduce a relocation problem for a station-based electric car-sharing system.•The problem is modeled as an Integer programming model that considers battery consumption and recharge.•Large-scale problems are solved through model-based heuristics which produce accurate solutions in short computing times.•Sensitivity analysis to problem structure and parameters provides useful insights on the problem. In this paper, we consider a station-based electric car-sharing system which allows one-way trips, and uses relocation to re-balance the vehicle distribution. We adopt the point-of-view of a service provider, whose objective is to maximize the profit associated with the trips performed by users. We introduce an exact relocation model for operating hours, and we explicitly consider the consumption and recharge process of electric vehicles batteries. In addition, the model is extended to the relocation operations to be performed at night, namely when the system is not operating. We also describe two model-based heuristics developed to solve the relocation model for operating hours on large-scale systems. The paper is concluded by a set of computational experiments on realistic data derived from an existing car-sharing system. The experiments investigate the scalability of the proposed model and highlight the circumstances under which the relocation operations can improve the system performance.