To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of electric vehicles. The resulting distribution planning problems present new computational challenges. We address a problem, called Electric Traveling Salesman Problem with Time Windows. We propose a mixed integer linear formulation that can solve 20-customer instances in short computing times and a Three-Phase Heuristic algorithm based on General Variable Neighborhood Search and Dynamic Programming. Computational results show that the heuristic algorithm can find the optimal solution in most small-size instances within a tenth of a second and achieves goods solutions in instances with up to 200 customers.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Electric Traveling Salesman Problem with Time Windows


    Contributors:


    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr




    The A Priori Dynamic Traveling Salesman Problem with Time Windows

    Larsen, A. / Madsen, O. B. G. / Solomon, M. M. | British Library Online Contents | 2004


    Learning implicit multiple time windows in the Traveling Salesman Problem

    Mortes, Jorge / Cousineau, Martin / Lehuédé, Fabien et al. | Elsevier | 2025

    Free access

    A New Heuristic for the Traveling Salesman Problem with Time Windows

    Calvo, Roberto Wolfler | Online Contents | 2000


    A New Heuristic for the Traveling Salesman Problem with Time Windows

    CALVO, R. W. | British Library Online Contents | 2000