OPSEARCH

, Volume 55, Issue 1, pp 150–164 | Cite as

A minimum spanning tree based heuristic for the travelling salesman tour

  • Santosh Kumar
  • Elias Munapo
  • ‘Maseka Lesaoana
  • Philimon Nyamugure
Theoretical Article
  • 94 Downloads

Abstract

This paper presents a heuristic to find the travelling salesman tour (TST) in a connected network. The approach first identifies a node and two associated arcs that are desirable for inclusion in the required TST. If we let this node be denoted by \(p\) and two selected arcs emanating from this node be denoted by \(\left( {p,q} \right)\,{\text{and}}\,\left( {p,k} \right),\) then we find a path joining the two nodes \(q\,{\text{and}}\, k\) passing through all the remaining nodes of the given network. A sum of these lengths, i.e. length of the links \(\left( {p,q} \right)\,{\text{and}}\,\left( {p,k} \right)\) along with the length of the path that joins the nodes \(q\,{\text{and}}\, k\) passing through all the remaining nodes will result in a feasible TST, hence gives an upper bound on the TST. A simple procedure is outlined to identify: (1) the node \(p\), (2) the two corresponding links \(\left( {p,q} \right)\,{\text{and}}\,\left( {p,k} \right),\) and (3) the path joining the nodes \(q\,{\text{and}}\, k\) passing through all the remaining nodes. The approach is based on the minimum spanning tree; hence the complexity of the TST is reduced. The network in the present context has been assumed to be a connected network with at least two arcs emanating from each node.

Keywords

Connected network Minimum spanning tree path Travelling salesman tour 

Notes

Acknowledgements

Authors are grateful to the referees for their constructive suggestions and helpful comments.

References

  1. 1.
    Angeniol, B., Vaubois, G.D.L.C., Texier, J.Y.: Self-organizing feature maps and the travelling salesman problem. Neural Netw. 1(4), 289–293 (1988)CrossRefGoogle Scholar
  2. 2.
    Anupam, G.: Deterministic MSTs, Lecture #1, Advanced Algorithms, CMU, Spring 15-859E, pp. 1–6 (2015)Google Scholar
  3. 3.
    Applegate, D.L., Bixby R.E., Chvatal, V., Cook, W.L.: The Traveling Salesman Problem: A Computational Study. Princeton series in Applied Mathematics. Princeton University Press, Princeton (2006)Google Scholar
  4. 4.
    Berman, P., Karpinski, M.: 8/7-approximation algorithm for (1,2)-TSP, Proc. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. Society for Industrial and Applied Mathematics, pp. 641–648 (2006)Google Scholar
  5. 5.
    Cowen, L.: Metric TSP and knapsack part 1, Lecture 3, Comp 260, Advanced Algorithms, Tufts University, pp. 1–8 (2016)Google Scholar
  6. 6.
    Danisman, K., Dalkiran, R., Celebi, F.V.: Design of a high precision temperature measurement system based on artificial neural network for different thermocouple types. Measurement 39, 695–700 (2006)CrossRefGoogle Scholar
  7. 7.
    Garg, R.C., Kumar, S., Dass, P., Sen, P.: Generalized travelling salesmen problem through N sets of nodes in a competitive market, AKOR, Ahlanf und Planningforschung, Band II, Heft 2, 116–120 (1970)Google Scholar
  8. 8.
    Garg, R.C., Kumar, S.: Shortest Connected graph through dynamic programming technique. Math. Mag. 41(4), 170–173 (1968)CrossRefGoogle Scholar
  9. 9.
    Dostal, P.: The comparison of methods solving the travelling salesmen problem. In: Eighth International Conference on Soft Computing Applications in Computer and Economic Environment, ICSC 2010, pp. 11–13 (2010)Google Scholar
  10. 10.
    Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variants. Springer, Berlin (2006)Google Scholar
  11. 11.
    Kumar, S., Munapo, E., Ncube, O., Sigauke, C., Nyamugure, P.: A minimum weight labeling method for determination of a shortest path in a non-directed network. Int. J. Syst. Assur. Eng. Manag 4(1), 13–18 (2013)CrossRefGoogle Scholar
  12. 12.
    Kumar, S., Munapo, E., Lesaoana, M., Nyamugure, M.: A minimum spanning tree approximation to the routing problem through ‘k’ specified nodes. J. Econ. 5(3), 307–312 (2014)CrossRefGoogle Scholar
  13. 13.
    Matai, R., Mittal, M.L., Singh, S.: Travelling salesman problem: An overview of applications, formulations and solution approaches. In: Davendra, D. (ed.) Chapter 1 in Travelling Salesman Problem: Theory and Applications, pp. 1–24. Intech Open Access Publisher, Rijeka (2010)Google Scholar
  14. 14.
    Mitchell, J.: Branch and cut algorithms for integer programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
  15. 15.
    Munapo, E.: A return to the Travelling salesman model: a network Branch and Bound Approach. S. Afr. J. Econ. Manag. Sci. 16(1), 52–63 (2013)CrossRefGoogle Scholar
  16. 16.
    Munapo, E., Jones, B.C., Kumar, S.: A minimum incoming weight label method and its applications to CPM Network. ORiON 24(1), 37–48 (2008)CrossRefGoogle Scholar
  17. 17.
    Munapo, E., Kumar, S., Lesaoana, M., Nyamugure, P.: A minimum spanning tree with index ≤ 2. ASOR Bull. 34(1), 1–14 (2016)Google Scholar
  18. 18.
    Nadef, D.: Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin, G., Punnen, A. (eds.) The traveling salesman problem and its variations, pp. 29–116. Kluwer, Dorcdrecht (2002)Google Scholar
  19. 19.
    Nemhauser, G.L., Wolsey, L.A.: Wiley-Interscience Series in Discrete Mathematics and Optimization: Integer and Combinatorial Optimization. North Holland, Amsterdam (1989)Google Scholar
  20. 20.
    Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. Siam Review 33(1), 60–100 (1991)CrossRefGoogle Scholar
  21. 21.
    Razali, N.M., Geraghty J.: Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the World Congress on Engineering, July 6–8, London, UK (2011)Google Scholar
  22. 22.
    Somhom, S., Modares, A., Enkawa, T.: A self-organizing model for the traveling salesman problem. J. Oper. Res. Soc. 48, 919–928 (1997)CrossRefGoogle Scholar
  23. 23.
    Winston, W.L.: Operations Research: Applications and Algorithms, 4th edn. Thomson Brooks/Cole, Salt Lake City (2004)Google Scholar
  24. 24.
    Wolsey, L.A.: Heuristics analysis, linear programming and branch and bound. Math. Program. Study 13, 121–134 (1980)CrossRefGoogle Scholar

Copyright information

© Operational Research Society of India 2017

Authors and Affiliations

  • Santosh Kumar
    • 1
  • Elias Munapo
    • 2
  • ‘Maseka Lesaoana
    • 3
  • Philimon Nyamugure
    • 4
  1. 1.Department of Mathematics and StatisticsUniversity of MelbourneParkvilleAustralia
  2. 2.School Economics and Decision SciencesNorth West University, Mafikeng CampusMafikengSouth Africa
  3. 3.Department of Statistics and Operations ResearchUniversity of LimpopoSovengaSouth Africa
  4. 4.Department of Statistics and Operations ResearchNational University of Science and TechnologyAscot, BulawayoZimbabwe

Personalised recommendations