International Journal of Computer Science & Network Security

International Journal of Computer Science & Network Security (국제컴퓨터통신보호논문지학회)
권호 표지
DOI QR코드

DOI QR Code

Intelligent Route Construction Algorithm for Solving Traveling Salesman Problem

  • Rahman, Md. Azizur (Mathematics Discipline, Science, Engineering and Technology School, Khulna University) ;
  • Islam, Ariful (Mathematics Discipline, Science, Engineering and Technology School, Khulna University) ;
  • Ali, Lasker Ershad (Mathematics Discipline, Science, Engineering and Technology School, Khulna University)
  • Received : 2021.04.05
  • Published : 2021.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

The traveling salesman problem (TSP) is one of the well-known and extensively studied NPC problems in combinatorial optimization. To solve it effectively and efficiently, various optimization algorithms have been developed by scientists and researchers. However, most optimization algorithms are designed based on the concept of improving route in the iterative improvement process so that the optimal solution can be finally found. In contrast, there have been relatively few algorithms to find the optimal solution using route construction mechanism. In this paper, we propose a route construction optimization algorithm to solve the symmetric TSP with the help of ratio value. The proposed algorithm starts with a set of sub-routes consisting of three cities, and then each good sub-route is enhanced step by step on both ends until feasible routes are formed. Before each subsequent expansion, a ratio value is adopted such that the good routes are retained. The experiments are conducted on a collection of benchmark symmetric TSP datasets to evaluate the algorithm. The experimental results demonstrate that the proposed algorithm produces the best-known optimal results in some cases, and performs better than some other route construction optimization algorithms in many symmetric TSP datasets.

Keywords

References

  1. Papadimitriou, C. H. (1977). The Euclidean travelling salesman problem is NP-complete. Theoretical computer science, 4(3), 237-244. https://doi.org/10.1016/0304-3975(77)90012-3
  2. Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the operations research society of America, 2(4), 393-410. https://doi.org/10.1287/opre.2.4.393
  3. Khanra, A., Maiti, M. K., & Maiti, M. (2015). Profit maximization of TSP through a hybrid algorithm. Computers & Industrial Engineering, 88, 229-236. https://doi.org/10.1016/j.cie.2015.06.018
  4. Ahrens, B. M. (2013). A tour construction framework for the travelling salesman problem. 1-8. IEEE.
  5. Reinelt, G. (2003). The traveling salesman: computational solutions for TSP applications. Vol. 840. Springer.
  6. Grotschel, M., & Lovasz, L. (1995). Combinatorial optimization. Handbook of combinatorics, 2(1541-1597), 168.
  7. El Krari, M., Ahiod, B., & El Benani, B. (2016). An empirical study of the multi-fragment tour construction algorithm for the travelling salesman problem. In. International Conference on Hybrid Intelligent Systems (pp. 278-287). Springer, Cham.
  8. Rahman, M. A., & Ma, J. (2018). Probe machine based consecutive route filtering approach to symmetric travelling salesman problem. In. International Conference on Intelligence Science (pp. 378-387). Springer, Cham.
  9. Rahman, M. A., & Ma, J. (2019). Solving symmetric and asymmetric traveling salesman problems through probe machine with local search. In. International Conference on Intelligent Computing (pp. 1-13). Springer, Cham.
  10. Rahman, M. A., & Ma, J. (2019). Probe Machine Based Optimization Approach for Capacitated Vehicle Routing Problem. In. 2019 IEEE International Conference on Signal, Information and Data Processing (ICSIDP) (pp. 1-6). IEEE.
  11. Johnson, D. S., & McGeoch, L. A. (1997). The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, 1(1), 215-310.
  12. Rosenkrantz, D. J., Stearns, R. E., & Lewis, II, P. M. (1977). An analysis of several heuristics for the traveling salesman problem. SIAM journal on computing, 6(3), 563-581. https://doi.org/10.1137/0206041
  13. Bentley, J. J. (1992). Fast algorithms for geometric traveling salesman problems. ORSA Journal on computing, 4(4), 387-411. https://doi.org/10.1287/ijoc.4.4.387
  14. Burke, L. I. (1994). Neural methods for the traveling salesman problem: insights from operations research. Neural Networks, 7(4), 681-690. https://doi.org/10.1016/0893-6080(94)90045-0
  15. Junger, M., Reinelt, G., & Rinaldi, G. (1995). The traveling salesman problem. Handbooks in operations research and management science, 7, 225-330.
  16. Klug, N., Chauhan, A., Vijayakumar, V., & Ragala, R. (2019). k-RNN: Extending NN-heuristics for the TSP. Mobile Networks and Applications, 24(4), 1210-1213. https://doi.org/10.1007/s11036-019-01258-y
  17. Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group.
  18. Williamson, D. P., & Shmoys, D. B. (2011). The design of approximation algorithms. Cambridge university press.
  19. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
  20. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp/
  21. http://www.math.uwaterloo.ca/tsp/data/index.html
  22. Reinelt, G. (1991). TSPLIB-A traveling salesman problem library. ORSA journal on computing, 3(4), 376-384. https://doi.org/10.1287/ijoc.3.4.376
  23. Jazayeri, A., & Sayama, H. (2020). A polynomial-time deterministic approach to the travelling salesperson problem. International Journal of Parallel, Emergent and Distributed Systems, 35(4), 454-460. https://doi.org/10.1080/17445760.2020.1776867