Skip to main content
Log in

The Location Routing Problem of the Car-Sharing System with Autonomous Electric Vehicles

  • Transportation Engineering
  • Published:
KSCE Journal of Civil Engineering Aims and scope Submit manuscript

This article has been updated

Abstract

Car-sharing, electrification, and autonomous driving are greatly revolutionizing the future of the transportation system. This study proposes a location routing problem for the car-sharing system with autonomous electric vehicles to determine optimal station location and vehicle routing, where each station is both a depot and a charging station. A mathematical model is formulated and then extended to three variants, while simultaneously considering different recharging and service options. The proposed mixed-integer nonlinear models are separately solved by general algebraic modeling system (GAMS) and genetic algorithm (GA), and the efficiency of the GA is demonstrated. The comparative experimental results of instances are presented, and the benefits of allowing partial recharge are obtained. More significant savings in cost can be achieved if partial service is simultaneously allowed. Furthermore, the trade-off between the operator’s interests and the interests of users, as well as the operator’s immediate profits and future profits, are explored through sensitivity analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Change history

  • 02 June 2021

    Additional “0” on online date during original publication.

Abbreviations

ae ik :

The remaining energy of vehicle k when arriving point i

at ik :

The arrival time of vehicle k at point i

C distance :

Unit distance cost of a vehicle

C reject :

Unit penalty cost incurred by rejecting a travel demand

C station :

Construction cost of the station, including installation cost of charging facilities

C vehicle :

Acquisition cost of a vehicle

D:{1,2,⋯m }:

Set of destinations of m travel demands, that is the set of delivery nodes

de ik :

The remaining energy of vehicle k when leaving point i

d ij :

Distance from point i to point j

dt ik :

The departure time of vehicle k at point i

E :

The battery capacity of the vehicle

et m :

Allowed earliest pick-up time of travel demand m

g :

The charging rate of charging infrastructure

H: {1, 2,⋯, h}:

Set of candidate locations, it’s just regarded as a set of depots

K:{1, 2, ⋯, k}:

Set of vehicles, k is the upper bound of the number of vehicles

lt m :

Allowed latest pick-up time of travel demand m, ltm =etm + ω, ω is the width of the time window

M: {1, 2,⋯, m}:

Set of travel demands, where m is the total number of travel demands N= Set of all points (N = HPOD)

O:{1+, 2+, ⋯, m +}:

Set of origins of m travel demands, that is the set of pickup nodes

P :

Set of all dummy nodes (∪h∈HPh), that is the set of all charging nodes

P h :

Set of dummy nodes for vertex hH, it’s regarded as the set of charging nodes corresponding to the vertex hH

r :

The consumption rate of the electric vehicle

t ij :

Travel time from point i to point j

T max :

Maximum operation time

x ijk :

Binary: if vehicle k travel from point i to point j

y i :

Binary: if candidate location iH is open as SAEVs’ station

References

Download references

Acknowledgments

This work was supported by the Fundamental Research Funds for the Central Universities under Grant 300102229111.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bingshan Ma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ma, B., Hu, D. & Wu, X. The Location Routing Problem of the Car-Sharing System with Autonomous Electric Vehicles. KSCE J Civ Eng 25, 3107–3120 (2021). https://doi.org/10.1007/s12205-021-1605-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12205-021-1605-5

Keywords

Navigation