Scholarly Research Excellence

Digital Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29023


Select areas to restrict search in scientific publication database:
10008525
An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem
Authors:
Abstract:
The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.
Digital Object Identifier (DOI):

References:

[1] R. M. Karp, “On the computational complexity of combinatorial problems,” Networks(USA), vol.5, no.1, pp. 45-68, 1975.
[2] M. Held, R. M. Karp, “A dynamic programming approach to sequencing problems,” Journal of the Society for Industrial and Applied Mathematics, vol.10, no.1, pp.196–210, 1962.
[3] R. Bellman, “Dynamic programming treatment of the travelling salesman problem,” Journal of the ACM, vol.9, no.1, pp.61–63, 1962.
[4] A. Björklund, “Determinant sums for undirected Hamiltonicity,” in Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, Las Vegas 2010, pp.173-182.
[5] D. L. Applegate, R. E. Bixby, V. Chvátal, W. Cook, D. G. Espinoza, M. Goycoolea, and K. Helsgaun, “Certification of an optimal TSP tour through 85900 cities,” Operations Research Letters, vol.37, no.1, pp.11–15, 2009.
[6] G. Gutin, A. P. Punnen, The traveling salesman problem and its variations. New York: Springer-Verlag, 2007.
[7] S. Arora, “Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems,” Journal of the ACM, vol.45, no.5, pp.753–782, 1998.
[8] T. Moemke, O. Svensson, “Approximating graphic TSP by matchings,” in Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, CA, USA, 2011, pp. 560–569.
[9] A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, “The traveling salesman problem in bounded degree graphs,” ACM Transactions on Algorithms, vol.8, no.2, Article No.18, 2012.
[10] M. Xiao, H. Nagamochi, “An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure,” Algorithmica, vol.74, no.2, pp.713–741, 2016.
[11] J. R. Correa, O. Larre, and J. A. Soto, “TSP tours in cubic graphs:beyond 4/3,” SIAM Journal on Discrete Mathematics, vol.29, no.2, pp.915–939, 2015.
[12] G. Borradaile, E. D. Demaine, and S. Tazari, “Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs,” Algorithmica, vol.68, no.2, pp.287–311, 2014.
[13] S. O. Gharan, A. Saberi, “The asymmetric traveling salesman problem on graphs with bounded genus,” in Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, USA, 2011, pp.967-975.
[14] S. Hougardy, R. S. Schroeder, “Edge elimination in TSP instances,” in International Workshop on Graph-Theoretic Concepts in Computer Science, Nouan-le-Fuzelier, France, 2014, pp.275-286.
[15] Y. Wang, “An approximate method to compute a sparse graph for traveling salesman problem,” Expert Systems with Applications, vol.42, no.12, pp.5150–5162, 2015.
[16] Y. Wang, J. B. Remmel, “A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals,” Journal of Graph Algorithms & Applications, vol.20, no.2, pp.411–434, 2016.
[17] K. Helsgaun, “An effective implementation of the Lin–Kernighan traveling salesman heuristic,” European Journal of Operational Research, vol. 126 no.1, pp.106-130, 2000.
[18] G. Reinelt, http://comopt.ifi.uni-heidelberg.de/groups/comopt /software/TSPLIB95/, 2017.
[19] H. Mittelmann, http://neos-server.org/neos/solvers/co:concorde/ TSP.html, 2016.
Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007