A Modified TSP: Algorithms and Experimentation System
Mateusz Borowski, Rafal Machon, Iwona Pozniak-Koszalka, Leszek Koszalka, Andrzej Kasprzak
Journal of Intelligent Computing, Vol. 6, No. 2, 2015.
DOI: 
Link: 
Abstract:
In this paper, the modified travelling salesman problem, in which the delivery time and the fuel consumption are taken into consideration, is studied. The objective is to create the metaheuristic algorithm which can find the best route in the
defined sense. Two algorithms, which are based on Ant Colony Optimization approach and Simulated Annealing approach,
are proposed. The properties of these algorithms are evaluated on the basis of the simulations made using the designed,
created and implemented experimentation system. Moreover, the paper contains the results of the comparison between the
proposed algorithms and the Nearest Neighbor and Random Search algorithms used as a reference. The comprehensive
studies show that the proposed algorithms based on Ant Colony Optimization can ensure the greatest profit among all
examined.