We study a setting where electric vehicles (EVs) can be hired to drive from pick-up to drop-off points in a mobility-on-demand (MoD) scheme. Each point in the MoD scheme is equipped with a battery swap facility that helps cope with the EVs' limited range. The goal of the system is to maximise the number of customers that are serviced. Thus, we first model and solve this problem optimally using Mixed-Integer Programming (MIP) techniques and show that the solution scales up to medium sized problems. Given this, we develop a greedy heuristic algorithm that is shown to generate near-optimal solutions and can scale to thousands of consumer requests and EVs. Both algorithms are evaluated in a setting using data of real locations of shared vehicle pick-up and drop-off stations and the greedy algorithm is shown to be on average 90% of the optimal in terms of average task completion.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Algorithms for Electric Vehicle Scheduling in Mobility-on-Demand Schemes


    Contributors:


    Publication date :

    2015-09-01


    Size :

    258656 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Congestion Management for Mobility-on-Demand Schemes that Use Electric Vehicles

    Rigas, Emmanouil S. / Tsompanidis, Konstantinos S. | British Library Conference Proceedings | 2020


    Evaluation of Vehicle Assignment Algorithms for Autonomous Mobility on Demand

    Goncu, Sadullah / Silgu, Mehmet Ali / Celikoglu, Hilmi Berk | IEEE | 2022


    Electric vehicle mobility modeling and energy resources scheduling

    KANG TAEHYEN | European Patent Office | 2018

    Free access

    Online Charge Scheduling for Electric Vehicles in Autonomous Mobility on Demand Fleets

    Tucker, Nathaniel / Turan, Berkay / Alizadeh, Mahnoosh | IEEE | 2019