Abstract
We present the results of a comparative statistical analysis of the time for solving the asymmetric traveling salesman problem (ATSP) with the branch-and-bound method (without precalculation of the tour) and with a hybrid method. The hybrid method consists of the Lin–Kernighan–Helsgaun approximate algorithm used to calculate the initial tour and the branch-and-bound method. We show that using an approximate solution found with the Lin–Kernighan–Helsgaun algorithm can significantly reduce the search time for the exact solution to the traveling salesman problem using the branch-and-bound method for problems from a certain class. We construct a prediction of the search time for the exact solution by the branchand- bound method and by the hybrid algorithm. A computational experiment has shown that the proportion of tasks solved faster by the hybrid algorithm than by the branch-and-bound method grows with increasing problem dimension.
Similar content being viewed by others
References
Little, J.D.C., Murty, K.G., Sweeney, D.W., and Karel, C., An Algorithm for the Traveling Salesman Problem, Oper. Res., 1963, no. 11, pp. 972–989.
Land, A.H. and Doig, A.G., An Automatic Method of Solving Discrete Programming Problems, Econometrica, 1960, vol. 28, no. 3, pp. 497–520.
Goodman, S.R. and Hedetniemi, S.T., Introduction to the Design and Analysis of Algorithms, New York: McGraw-Hill, 1977. Translated under the title Vvedenie v razrabotku i analiz algoritmov, Moscow: Mir, 1981.
Korte, B. and Vygen, J., Combinatorial Optimization: Theory and Algorithms, Berlin: Springer, 2007.
Matai, R., Mittal, M.L., and Singh, S., Travelling Salesman Problem: An Overview of Applications, Formulations and Solution Approaches, in Travelling Salesman Problem: Theory and Applications, Davendra, D., Ed., Rijeka: Intech Open Access Publisher, 2010, pp. 1–24.
Slominski, L., Probabilistic Analysis of Combinatorial Algorithms: A Bibliography with Selected Annotations, Computing, 1982, vol. 28, pp. 257–267.
Kolesnikov, A.V., Kirikov, I.A., Listopad, S.V., et al., Reshenie slozhnykh zadach kommivoyazhera metodami funktsional’nykh gibridnykh intellektual’nykh sistem (Solving Complex Travelling Salesman Problems with Functional Hybrid Intelligent Systems), Kolesnikov, A.V., Ed., Moscow: IPI RAN, 2011.
Ul’yanov, M.V., Resursno-effektivnye komp’yuternye algoritmy. Razrabotka i analiz (Resource-Efficient Computer Algorithms: Development and Analysis), Moscow: Fizmatlit, 2008.
Sergeev, S., Nonlinear Resolving Functions for the Travelling Salesman Problem, Autom. Remote Control, 2013, vol. 74, no. 6, pp. 978–994.
Oliver, I., Smith, D., and Holland, J., A Study of Permutation Crossover Operators on the Traveling Salesman Problem, in Proc. 2 Int. Conf. Genet. Algorithm, Grefenstette, J., Ed., Hillsdale, New Jersey: Lawrence Erlbaum Associates Inc., 1987, pp. 224–230.
Cotta, C., Aldana, J., Nebro, A., and Troya, J., Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP, in Artificial Neural Nets and Genetic Algorithm 2, Pearson, D., Steele, N., Albrecht, R., Eds., Wien: Springer-Verlag, 1995, pp. 277–280.
Goldberg, D. and Lingle, R.J., Alleles, Loci, and the Travelling Salesman Problem, in Proc. Ist Int. Conf. on Genetic Algorithms (ICGA’ 85), Grefenstette, J., Ed., Hillsdale, New Jersey: Lawrence Erlbaum Associates Inc., 1985, pp. 154–159.
Toriello, A., Optimal Toll Design: A Lower Bound Framework for the Asymmetric Traveling Salesman Problem, Math. Programm., 2014, vol. 144, no. 1/2, pp. 247–264.
Cornuéjols, G., Karamanov, M., and Li, Y., Early Estimates of the Size of Branch-and-Bound Trees, INFORMS J. Comput., 2006, vol. 18, no. 1, pp. 86–96.
Fomichev, M.I., Comparative Analysis of Metaheuristic Algorithms for Solving an Asymmetric Traveling Salesman Problem, Sist. Upravlen. Inform. Tekhnol., 2017, no. 3(69), pp. 88–92.
Goloveshkin, V.A., Zhukova, G.N., Ul’yanov, M.V., and Fomichev, M.I., Distribution of the Logarithm of Complexity for Individual Traveling Salesman Problems with a Fixed Input Size, Sovremen. Inform. Tekhnol. IT-Obrazov., 2016, vol. 12, no. 3, part 2, pp. 131–137.
Knuth, D.E., Estimating the Efficiency of Backtracking Programs, Math. Comput., 1975, vol. 29, pp. 121–136.
Panteleev, A.V., Metaevristicheskie algoritmy poiska global’nogo ekstremuma (Metaheuristic Algorithms for Global Extremum Search), Moscow: MAI-PRINT, 2009.
Applegate, D.L., Bixby, R.E., Chavatal, V., and Cook, W.J.K., The Traveling Salesman Problem, Princeton: PUP, 2006.
Colorni, A., Dorigo, M., and Maniezzo, V., Distributed Optimization by Ant Colonies, Proc. First Eur. Conf. on Artificial Life, Varela, F. and Bourgine, P., Eds., Paris: Elsevier, 1991, pp. 134–142.
Dorigo, M. and Gambardella, L. M., Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Trans. Evol. Comput., Apr. 1997, vol. 1, no. 1, pp. 53–66.
Bonavear, E. and Dorigo, M., Swarm Intelligence: From Natural to Artificial Systems, Oxford: OUP, 1999.
Gamboa, D., Rego, C., and Glover, F., Data Structures and Ejection Chains for Solving Large Scale Traveling Salesman Problems, Eur. J. Oper. Res., 2005, vol. 160(1), pp. 154–171.
Kaplan, H., Lewenstein, M., Shafrir, N., and Sviridenko, M., Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs, J. ACM (JACM), 2005, vol. 52, no. 4, pp. 602–626.
Mömke, T. and Svensson, O., Removing and Adding Edges for the Traveling Salesman Problem, J. ACM, 2016, vol. 63, no. 1, pp. 1–28.
Borodin, V.V., Lovetskij, S.E., Melamed, I.I., and Plotinskij, Yu.M., Experimental Study of the Efficiency of Heuristic Algorithms for Solution of the Traveling Salesman Problem, Autom. Remote Control, 1980, vol. 41, no. 11, pp. 1543–1550.
Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, Cambridge: MIT Press, 2009, 3rd ed.
Stutzle, T. and Hoos, H.H., Max-Min Ant System, Future Generat. Comput. Syst., 2000, vol. 16, pp. 889–914.
Lin, S. and Kernighan, B.W., An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Oper. Res., 1973, vol. 21, pp. 498–516.
Helsgaun, K., An Effective Implementation of the Lin–Kernighan Traveling Salesman Heuristic, Eur. J. Oper. Res., 2000, vol. 126(1), pp. 106–130.
Zhukova, G.N., Ul’yanov, M.V., and Fomichev, M.I., Exact Time-Efficient Combined Algorithm for Solving the Asymmetric Traveling Salesman Problem, Biznes-Informatika, 2018, no. 3(45), pp. 20–28.
Moors, J.J.A., A Quantile Alternative for Kurtosis, Statist, 1988, vol. 37, pp. 25–32.
Moors, J.J.A., Wagemakers, R.Th.A., Coenen, V.M.J., et al., Characterizing Systems of Distributions by Quantile Measures, Statist. Neerlandica, 1996, vol. 50, no. 3, pp. 417–430.
Goloveshkin, V.A., Zhukova, G.N., Ulyanov, M.V., and Fomichev, M.I., Probabilistic Prediction of the Complexity of Traveling Salesman Problems Based on Approximating the Complexity Distribution from Experimental Data, Autom. Remote Control, 2018, vol. 79, no. 7, pp. 1296–1310.
Cramer, H., Mathematical Methods of Statistics, Princeton: Princeton Univ. Press, 1937. Translated under the title Matematicheskie metody statistiki, Moscow: Mir, 1975.
Acknowledgments
This work was supported by the Russian Science Foundation, project no. 17-19-01665.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Russian Text © The Author(s), 2019, published in Avtomatika i Telemekhanika, 2019, No. 11, pp. 155–172.
Rights and permissions
About this article
Cite this article
Zhukova, G.N., Ul’yanov, M.V. & Fomichev, M.I. A Hybrid Exact Algorithm for the Asymmetric Traveling Salesman Problem: Construction and a Statistical Study of Computational Efficiency. Autom Remote Control 80, 2054–2067 (2019). https://doi.org/10.1134/S0005117919110092
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117919110092