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.
The Electric Traveling Salesman Problem with Time Windows
2016
Article (Journal)
English
The A Priori Dynamic Traveling Salesman Problem with Time Windows
Online Contents | 2004
|The A Priori Dynamic Traveling Salesman Problem with Time Windows
British Library Online Contents | 2004
|Learning implicit multiple time windows in the Traveling Salesman Problem
Elsevier | 2025
|A New Heuristic for the Traveling Salesman Problem with Time Windows
Online Contents | 2000
|A New Heuristic for the Traveling Salesman Problem with Time Windows
British Library Online Contents | 2000
|