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.
| Published in | Pure and Applied Mathematics Journal (Volume 4, Issue 1) |
| DOI | 10.11648/j.pamj.20150401.12 |
| Page(s) | 9-23 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2015. Published by Science Publishing Group |
Traveling Salesman Problem, TSP, Minimum Travel Cost Approach, TSPLIB, TSP 43-nodes
| [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. |
APA Style
Mohamed Eleiche. (2015). Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem. Pure and Applied Mathematics Journal, 4(1), 9-23. https://doi.org/10.11648/j.pamj.20150401.12
ACS Style
Mohamed Eleiche. Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem. Pure Appl. Math. J. 2015, 4(1), 9-23. doi: 10.11648/j.pamj.20150401.12
AMA Style
Mohamed Eleiche. Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem. Pure Appl Math J. 2015;4(1):9-23. doi: 10.11648/j.pamj.20150401.12
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.pamj.20150401.12,
author = {Mohamed Eleiche},
title = {Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem},
journal = {Pure and Applied Mathematics Journal},
volume = {4},
number = {1},
pages = {9-23},
doi = {10.11648/j.pamj.20150401.12},
url = {https://doi.org/10.11648/j.pamj.20150401.12},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.pamj.20150401.12},
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.},
year = {2015}
}
TY - JOUR T1 - Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem AU - Mohamed Eleiche Y1 - 2015/01/30 PY - 2015 N1 - https://doi.org/10.11648/j.pamj.20150401.12 DO - 10.11648/j.pamj.20150401.12 T2 - Pure and Applied Mathematics Journal JF - Pure and Applied Mathematics Journal JO - Pure and Applied Mathematics Journal SP - 9 EP - 23 PB - Science Publishing Group SN - 2326-9812 UR - https://doi.org/10.11648/j.pamj.20150401.12 AB - 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. VL - 4 IS - 1 ER -
Email: