A three-phase algorithm for the pollution traveling Salesman problem

This paper studies a variant of the Pollution Traveling Salesman Problem (PTSP) focused on fuel consumption and pollution emissions (PTSPC). The PTSPC generalizes the well-known Traveling Salesman Problem (TSP), classified as NP-Hard. In the PTSPC, a vehicle must deliver a load to each customer thro...

Full description

Bibliographic Details
Published in:Heliyon
Main Authors: Karen García-Vasquez, Rodrigo Linfati, John Willmer Escobar
Format: Article
Language:English
Published: Elsevier 2024-05-01
Subjects:
Matheheuristic algorithm
Heuristic
VNS
Tabu search
Simulated annealing
Pollution Traveling Salesman
Online Access:http://www.sciencedirect.com/science/article/pii/S2405844024059899

Internet

http://www.sciencedirect.com/science/article/pii/S2405844024059899

Similar Items