Abstract
Different algorithmic performances are required in different engineering fields for solving both the symmetric and asymmetric traveling salesman problem (STSP and ATSP), both of which are commonly referred to as TSP. In the background of small-scale TSP, according to the principle of the optimal Hamiltonian loop, this paper describes an angular bisector insertion algorithm (ABIA) that can solve TSP. The main processes of ABIA are as follows. First, the angular bisector of the point group is constructed. Second, the farthest vertex perpendicular to the angular bisector is identified as the search criterion. Finally, for both STSP and ATSP, initial loop formation rules and vertex insertion rules are constructed. Experiments were conducted for all STSP and ATSP instances with up to 100 points in the TSPLIB database. The performance of ABIA was compared with that of the 2-point farthest insertion algorithm, convex hull insertion algorithm, branch-and-bound algorithm, and a genetic algorithm. The experimental results show that, for small-scale TSP (up to 40 points), the runtime of ABIA is second only to the convex hull insertion algorithm, and the gap between ABIA and the optimal solution is second only to the exact algorithm. ABIA offers good overall performance in solving small-scale TSP.
Similar content being viewed by others
References
Bondy JA, Murty USR (1976) Graph theory with applications. The Macmillan Press Ltd, New York
Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th international joint conference on artificial intelligence. Los Angeles, CA, USA. 162–164
De Jong K, De Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. University of Michigan, Michigan
Dirac GA (1952) Some theorems on abstract graphs. Proc London Math Soc s3-2:69–81
Ezugwu AES, Adewumi AO (2017) Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst Appl 87:70–78. https://doi.org/10.1016/j.eswa.2017.06.007
Golden B, Bodin L, Doyle T, Stewart W (1980) Approximate traveling salesman algorithms. Oper Res 28:694–711
Gower JC (1966) Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika 53:325–338
Hore S, Chatterjee A, Dewanji A (2018) Improving variable neighborhood search to solve the traveling salesman problem. Appl Soft Comput J 68:83–91. https://doi.org/10.1016/j.asoc.2018.03.048
Hui W (2012) Comparison of several intelligent algorithms for solving TSP problem in industrial engineering. Syst Eng Proc 4:226–235. https://doi.org/10.1016/j.sepro.2011.11.070
Ismail AH (2019) Domino algorithm: a novel constructive heuristics for traveling salesman problem. IOP Conf Ser Mater Sci Eng. https://doi.org/10.1088/1757-899X/528/1/012043
Jünger M, Reinelt G, Rinaldi G (1995) The traveling salesman problem. Handbooks Oper Res Manag Sci 7:225–330
Kanda J, de Carvalho A, Hruschka E et al (2016) Meta-learning to select the best meta-heuristic for the traveling salesman problem: a comparison of meta-features. Neurocomputing 205:393–406. https://doi.org/10.1016/j.neucom.2016.04.027
Ore O (1960) Note on hamilton circuits. Am Math Mon 67:55
Pan G, Li K, Ouyang A, Li K (2016) Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. Soft Comput 20:555–566. https://doi.org/10.1007/s00500-014-1522-3
Rao W, Jin C (2012) An improved greedy heuristic based on solving traveling salesman problem. Oper Res Manag Sci 6:1–9
Reinelt G (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3:376–384
Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer-Verlag, Berlin, Heidelberg
Rosenkrantz DJ, Stearns RE, Lewis Ii PM et al (1977) An analysis of several heuristics for the traveling salesman problem * under the title approximate algorithms for the traveling salesperson problem. SIAM J Comput 6:563–581
Sakurai Y, Onoyama T, Kubota S et al (2006) A Multi-world intelligent genetic algorithm to interactively optimize large-scale TSP. Proc 2006 IEEE Int Conf Inf Reuse Integr IRI-2006. https://doi.org/10.1109/IRI.2006.252421
Siemiński A, Kopel M (2019) Solving dynamic TSP by parallel and adaptive ant colony communities. J Intell Fuzzy Syst 37:7607–7618. https://doi.org/10.3233/JIFS-179366
Ursani Z, Corne DW (2016) Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem. J Optim 2016:1–15. https://doi.org/10.1155/2016/4786268
Xiang Z, Chen Z, Gao X et al (2015) Solving large-scale TSP using a fast wedging insertion partitioning approach. Math Probl Eng. https://doi.org/10.1155/2015/854218
Yang Z, Xiao MQ, Ge YW et al (2018) A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods. Eur J Oper Res 265:65–80. https://doi.org/10.1016/j.ejor.2017.07.024
Yang L, Hu X, Li K, et al (2019) Nested simulated annealing algorithm to solve large-scale TSP problem. In: International symposium on intelligence computation and applications. Springer, pp 473–487
Zhang ZC, Han W, Mao B (2018) Adaptive discrete cuckoo algorithm based on simulated annealing for solving TSP. Acta Electron Sin 46:1849–1857
Zhong Y, Lin J, Wang L, Hui Z (2018) Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol Comput S2210650216304680
Zhu J, Huai L, Cui R (2017) Research and Application of Hybrid Random Selection Genetic Algorithm. In: 2017 10th International Symposium on Computational Intelligence and Design (ISCID). pp 330–333
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lin, J., Zeng, X., Liu, J. et al. Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem. J Comb Optim 43, 235–252 (2022). https://doi.org/10.1007/s10878-021-00759-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00759-5