Probe Machine Based Consecutive Route Filtering Approach to Symmetric Travelling Salesman Problem

  • Md. Azizur Rahman
  • Jinwen MaEmail author
Conference paper
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 539)


The travelling salesman problem (TSP) is one of the NPC combinatorial optimization problems and still now it remains as an interesting and challenging problem in the field of combinatorial optimization. In this paper, we propose a consecutive route filtering approach to solving the symmetric TSP with the help of probe concept such that the worse routes are filtered out step by step by using a rigorous predesigned step proportion. In this way, it is important to set up a reasonable value of the step proportion which is needed in each step during the filtering process. Actually, our proposed algorithm is implemented on the set of symmetric TSP benchmarks with both small and large numbers of cities from the TSPLIB dataset. It is demonstrated by the experimental results that our proposed algorithm can obtain the best results in some cases and generally get the approximation results close to the best known solutions.


Probe machine Travelling salesman problem Filtering proportion Discrete optimization 



This work is supported by the Natural Science Foundation of China for Grant 61171138.


  1. 1.
    Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theoryof NP-Completeness. W. H. Freeman, New York (1979)zbMATHGoogle Scholar
  3. 3.
    Matai, R., Singh, S.P., Mittal, M.L.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications, pp. 1–24. InTech, Croatia (2010)Google Scholar
  4. 4.
    MacGregor, J.N., Chu, Y.: Human performance on the traveling salesman and related problems: a review. J. Probl. Solving 3(2), article 2 (2011)Google Scholar
  5. 5.
    Finke, G., Claus, A., Gunn, E.: A two-commodity network flow approach to the traveling salesman problem. Congr. Numer. 41, 167–178 (1984)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196–210 (1962)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21(3), 307–317 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16(3), 538–558 (1968)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Rosenkrantz, D.J., Stearns, R.E., Philip, M.L.I.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lin, S.: Computer solutions of the travelling salesman problem. Bell Syst. Tech. J. 44(10), 2245–2269 (1965)zbMATHCrossRefGoogle Scholar
  12. 12.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498–516 (1973)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I., Roucairol, C.C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433–458. Kluwer Academic Publishers, Boston (1999)CrossRefGoogle Scholar
  14. 14.
    Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Hore, S., Chatterjee, A., Dewanji, A.: Improving variable neighborhood search to solve the traveling salesman problem. Appl. Soft Comput. 68, 83–91 (2018)CrossRefGoogle Scholar
  16. 16.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.: Optimization by simulated annealing. Sci. New Ser. 220(4598), 671–680 (1983)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65–85 (1994)CrossRefGoogle Scholar
  18. 18.
    Guo, D., Chen, H., Wang, B.: An improved genetic algorithm with decision function for solving travelling salesman problem. In: Proceeding of 12th ISKE. IEEE Conferences, Nanjing, China, pp. 1–7 (2017).
  19. 19.
    Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F., Bourgine, P. (eds.) Proceedings of European Conference on Artificial Life, Paris, France, pp. 134–142 (1991)Google Scholar
  20. 20.
    Shufen, L., Huang, L., Lu, H.: Pheromone model selection in ant colony optimization for the travelling salesman problem. Chin. J. Electron. 26(2), 223–229 (2017)CrossRefGoogle Scholar
  21. 21.
    Xiong, N., Wu, W., Wu, C.: An improved routing optimization algorithm based on travelling salesman problem for social networks. Auton. Sustain. Comput. Prep. Internet Things Environ. 9(6), 985 (2017)Google Scholar
  22. 22.
    Ratanavilisagul, C.: Modified ant colony optimization with pheromone mutation for travelling salesman problem. In: Proceeding of 14th ECTI-CON. IEEE Conferences, Phuket, Thailand, pp. 411–414 (2017).
  23. 23.
    Cheng, M.-Y., Prayogo, D.: Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput. Struct. 139, 98–112 (2014)CrossRefGoogle Scholar
  24. 24.
    Ezugwu, A.E.-S., Adewumi, A.O.: Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert. Syst. Appl. 87, 70–78 (2017)CrossRefGoogle Scholar
  25. 25.
    Ezugwu, A.E.-S., Adewumi, A.O., Frîncu, M.E.: Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert. Syst. Appl. 77(1), 189–210 (2017)CrossRefGoogle Scholar
  26. 26.
    Ozden, S.G., Smith, A.E., Gue, K.R.: Solving large batches of travelling salesman problems with parallel and distributed computing. Comput. Oper. Res. 85, 87–96 (2017)MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    Xu, J.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27(7), 1405–1416 (2016)MathSciNetCrossRefGoogle Scholar
  28. 28.
  29. 29.

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  1. 1.Department of Information Science, School of Mathematical Sciences and LMAMPeking UniversityBeijingPeople’s Republic of China

Personalised recommendations