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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Electric Vehicle Routing with Soft Time Windows


    Contributors:
    Xu, Wei (author)

    Conference:

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


    Published in:

    CICTP 2022 ; 2516-2525


    Publication date :

    2022-09-08




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English