Highlights We introduce the Traveling Salesman Problem with Time Windows for electric vehicles. A mathematical model able to solve to optimality small-size instances is proposed. A heuristic algorithm is proposed and tested on instances with up to 200 customers.

    Abstract 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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The Electric Traveling Salesman Problem with Time Windows


    Beteiligte:
    Roberti, R. (Autor:in) / Wen, M. (Autor:in)


    Erscheinungsdatum :

    2016-01-18


    Format / Umfang :

    21 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    The A Priori Dynamic Traveling Salesman Problem with Time Windows

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


    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