Hybrid metaheuristic algorithms for solving TSP
Received: 10 Oct 2026 Revised: 19 Oct 2026 Accepted: 25 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 192–195
Abstract
A suite of metaheuristic algorithms has been developed to solve the traveling salesperson problem on complete weighted graphs: classical simulated annealing (SA), parallel SA with solution exchange, and simulated quantum annealing (SQA). Computational experiments were conducted using benchmark graphs of varying sizes, alongside a comparative analysis with the LKH algorithm.
Keywords: Traveling Salesman Problem, TSP, metaheuristic algorithms, simulated annealing, simulated quantum annealing, LKH.
BibTeX
@article{IS-Sobolev-Khvorostukhina2026,
author = {Sobolev, Alexey Ivanovich and Khvorostukhina, Ekaterina Vladimirovna},
title = {{Hybrid metaheuristic algorithms for solving TSP}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {192--195},
}
AMSBIB
\Bibitem{IS-Sobolev-Khvorostukhina2026}
\by A.\,I.~Sobolev, E.\,V.~Khvorostukhina
\paper Hybrid metaheuristic algorithms for solving TSP
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 192--195
\lang In Russian
RU