Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem
Pure and Applied Mathematics Journal
Volume 4, Issue 1, February 2015, Pages: 9-23
Received: Dec. 28, 2014; Accepted: Jan. 11, 2015; Published: Jan. 30, 2015
Views 2436      Downloads 93
Author
Mohamed Eleiche, Geo Tiba Systems, Cairo, Egypt
Article Tools
Follow on us
Abstract
The minimum travel cost is a new approach to solve the Travelling Salesman Problem (TSP). The TSP library website (TSPLIB) provides several TSP problems with their best knownsolutions as a means to test any proposed algorithm. The present paper successfully applies the minimum travel cost algorithmto the 43 nodes P43problem which has the value of 5620 for its best knownsolution.This paper provides the details of the solution for value of 5621.
Keywords
Traveling Salesman Problem, TSP, Minimum Travel Cost Approach, TSPLIB, TSP 43-nodes
To cite this article
Mohamed Eleiche, Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem, Pure and Applied Mathematics Journal. Vol. 4, No. 1, 2015, pp. 9-23. doi: 10.11648/j.pamj.20150401.12
References
[1]
Eleiche, Mohamed, and Bela Markus. "Applying minimu travel cost approach to 17-nodes travelling salesman problem." GEOMATIKAI KOZLEMENYEK (RESEARCH CENTRE FOR ASTRONOMY AND EARTH SCIENCES, HUNGARIAN ACADEMY OF SCIENCES) XIII, no. 2 (2010): 15-22.
[2]
The TSPLIB website (https://www.tsp.gatech.edu/problem/index.html)
[3]
GutinG., and Punnen. A.P. (2007): Experimental Analysis of Heuristics for the ATSP. In Gutin&Punnen (Eds.): The Traveling Salesman Problem and Its Variations. Springer, 2007. p.369-444.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186