IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v18y2024i5p766-788.html
   My bibliography  Save this article

One-way station-based electric carsharing service design considering route selection based on road congestion

Author

Listed:
  • Yangsheng Jiang
  • Hao Li
  • Lu Hu
  • Yun Pu

Abstract

In the field of one-way station-based electric carsharing systems (OSECSs), determining the optimal service design is a major challenge faced by operators. To address this issue, This study proposes a simulation-optimisation framework that takes into account several factors, such as fleet size, station capacity, rental pricing, vehicle relocation, and staff rebalancing to determine the optimal service design. Specially, the simulation module of this framework is used to evaluates the performance of different carsharing service designs by taking into account the selection of optimal routes based on road congestion, nonlinear charging profiles, and elastic demand influenced by price and travel time. In the optimisation module of this framework, the study introduces a novel greedy genetic search algorithm to solve the optimisation problem. The proposed simulation-optimisation framework is tested on a carsharing network with 15 stations in Chengdu, China, and the numerical experiment shows its efficiency. Additionally, the study analyzes the impact of different degrees of demand and travel time variation, demand scenarios, and road congestion scenarios on the OSECS. By doing so, it provides a more comprehensive understanding of the system and the factors that affect its performance.

Suggested Citation

  • Yangsheng Jiang & Hao Li & Lu Hu & Yun Pu, 2024. "One-way station-based electric carsharing service design considering route selection based on road congestion," Journal of Simulation, Taylor & Francis Journals, vol. 18(5), pages 766-788, September.
  • Handle: RePEc:taf:tjsmxx:v:18:y:2024:i:5:p:766-788
    DOI: 10.1080/17477778.2023.2204196
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/17477778.2023.2204196
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/17477778.2023.2204196?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjsmxx:v:18:y:2024:i:5:p:766-788. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.