The dial-a-ride problem with electric vehicles and battery swapping stations

Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir, Konstantinos N. Genikomsakis, Naoufel Cheikhrouhou

    Research output: Contribution to journalArticlepeer-review

    93 Scopus citations


    The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for customers with special needs and/or disabilities. The DARP with Electric Vehicles and battery swapping stations (DARP-EV) concerns scheduling a fleet of EVs to serve a set of pre-specified transport requests during a certain planning horizon. In addition, EVs can be recharged by swapping their batteries with charged ones from any battery-swap stations. We propose three enhanced Evolutionary Variable Neighborhood Search (EVO-VNS) algorithms to solve the DARP-EV. Extensive computational experiments highlight the relevance of the problem and confirm the efficiency of the proposed EVO-VNS algorithms in producing high quality solutions.

    Original languageBritish English
    Pages (from-to)392-420
    Number of pages29
    JournalTransportation Research Part E: Logistics and Transportation Review
    StatePublished - Oct 2018


    • Battery swapping
    • Dial-a-ride problem
    • Electric vehicle
    • Evolutionary variable neighborhood search metaheuristic algorithm


    Dive into the research topics of 'The dial-a-ride problem with electric vehicles and battery swapping stations'. Together they form a unique fingerprint.

    Cite this