Relocation optimization of electric cars in one-way car-sharing systems: modeling, exact solving and heuristics algorithms

ABSTRACT

Car-sharing system with electric cars is a very convenient service for urban transportation: it allows users to pick up a vehicle at a station and rent it during a short time. To manage this kind of system in the best way, it is necessary to solve the critical problem of vehicle stock imbalance across the stations. Several decision levels must be considered to balance the car distribution by taking into account the quality of service and the system operation cost. To this end, a linear programming model is proposed to formalize the problem in a mathematical framework, which allows the computation of optimal vehicle distribution strategies. To make our solution time efficient and usable for solving large problems, a greedy algorithm and a tabu search algorithm are proposed. These two algorithms are applied to the Auto Bleue network in Nice and its surrounding (France) using extensive simulations. Besides, an integrated mapping method is provided within the Geographical Information System QGIS to estimate flows and their locations. Numerical results demonstrate that the tabu search algorithm is able to find near-optimal solutions and good compromises between client satisfaction, number of staff agents and vehicles used, and computing time.

KEYWORDS:

• Car-sharing
• one-way electric-car-sharing routing problem (OECRP)
• vehicle routing
• vehicle redistribution
• linear programming
• tabu search
• greedy algorithm
• Auto Bleue service in Nice
• Geographical Information Systems
• gravity model

Acknowledgment

We thank a lot the PACA region in France for funding the Amine Aitouahmed’s PhD thesis.

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

We thank a lot the PACA region in France for funding the Amine Aitouahmed’s PhD thesis.