Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

Hybrid metaheuristic algorithms for solving TSP

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
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover