This paper addresses the problem of the meeting-point-based electric demand responsive transport routing and charging scheduling under charging synchronization constraints. The problem considered exhibits a similar structure with the location-routing problem, which is more difficult to solve than many electric vehicle routing problems with capacitated charging stations. We propose to model the problem using a mixed integer linear programming approach based on a layered graph structure. A two-stage simulated annealing based algorithm is proposed to solve the problem efficiently. The algorithm is tested on 20 instances with up to 100 customers and 49 bus stops. The results show that the proposed algorithm outperforms the best solutions found by a commercial mixed-integer linear programming solver set with a 2-hour computational time limit for 12/20 test instances and with less than 1-minute computational time on average.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Fast Algorithm to Optimize Electric First-Mile Feeder Services with Charging Synchronization Constraints and Customer Rejections


    Beteiligte:
    Ma, Tai-Yu (Autor:in) / Fang, Yumeng (Autor:in) / Connors, Richard (Autor:in) / Viti, Francesco (Autor:in) / Nakao, Haruko (Autor:in)


    Erscheinungsdatum :

    2023-09-24


    Format / Umfang :

    3190894 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Fast monoplane for feeder services

    Engineering Index Backfile | 1933



    A large neighborhood search algorithm to optimize a demand-responsive feeder service

    Galarza Montenegro, Bryan David / Sörensen, Kenneth / Vansteenwegen, Pieter | Elsevier | 2021


    Optimizing first-mile ridesharing services to intercity transit hubs

    He, Ping / Jin, Jian Gang / Schulte, Frederik et al. | Elsevier | 2023