Distance and Energy Consumption Minimization in Electric Traveling Salesman Problem with Time Windows

As global pollution caused by transportation increases, the need for cleaner energy becomes more significant each day. For this reason, one of the recent global technological and scientific tendencies is to develop and include electric vehicles in transportation. In this paper, an Electric Traveling Salesman Problem with Time Windows was studied by considering two objectives: minimizing the total distance and minimizing the total energy consumption. As a solution method, the well-known Simulated Annealing algorithm was hybridized with a constructive heuristic and a local search heuristic. This algorithm was executed on a set of well-known benchmark instances from the literature separately for the two objectives and the results were presented.