In this paper, we introduce the Electric Vehicle Routing Problem with Flexible Time Windows (EVRPFTW) in which vehicles are allowed to serve customers before and after the earliest and latest time window bounds, respectively. The objective of this problem is to assign electric vehicles to feasible routes and make schedules with minimum total cost that includes the traveling costs, the costs of using electric vehicles and the penalty costs incurred for earliness and lateness. The proposed mathematical model is solved by a column generation procedure. To generate an integer solution, we solve an integer programming problem using the routes constructed by the column generation algorithm. We further develop a linear programming model to compute the optimal times to start service at each customer for the selected routes. A number of well-known benchmark instances is solved by our solution procedure to evaluate the operational gains obtained by employing flexible time windows.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Electric vehicle routing with flexible time windows: a column generation solution approach


    Contributors:
    Taş, Duygu (author)

    Published in:

    Transportation Letters ; 13 , 2 ; 97-103


    Publication date :

    2021-02-07


    Size :

    7 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows

    Chen, Z.-L. / Xu, H. | British Library Online Contents | 2006



    A vehicle routing problem with flexible time windows

    Taş, Duygu / Van Woensel, Tom / JABALI, OLA | BASE | 2014

    Free access

    A vehicle routing problem with flexible time windows

    Tas, D. / Jabali, O. / Woensel, van, T. | BASE | 2013

    Free access