Due to the new policies regarding greenhouse gas emission, logistics enterprises have already integrated electric vehicles (EVs) into their fleets, especially for delivery services in the center of large cities. Due to the limited battery capacity of EVs, visits to charging stations need to be considered in the routes. This paper addresses the electric vehicle routing problem with soft time windows (EVRPSTW). The problem is to determine the optimal routes of a homogeneous fleet of EVs, to minimize the total cost, which includes the number of EVs, the distance traveled, the charging time, and the time window penalty. Since the vehicle routing problem is NP-hard, a simulated annealing (SA) based heuristic method was developed and its efficacy was demonstrated over a direct solution of the mixed integer linear programming formulations of the underlying problems using commercial software (CPLEX). The computational experiment reveals the efficacy of the method.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Electric Vehicle Routing with Soft Time Windows


    Beteiligte:
    Xu, Wei (Autor:in)

    Kongress:

    22nd COTA International Conference of Transportation Professionals ; 2022 ; Changsha, Hunan Province, China


    Erschienen in:

    CICTP 2022 ; 2516-2525


    Erscheinungsdatum :

    08.09.2022




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch