Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …

Abstract We address the Traveling Salesman Problem (TSP), a famous NP-hard
combinatorial optimization problem. And we propose a variable strategy reinforced …

We propose a new method called the Reinforced Hybrid Genetic Algorithm (RHGA) for
solving the famous NP-hard Traveling Salesman Problem (TSP). Specifically, we combine …

Abstract The Lin-Kernighan-Helsgaun (LKH) algorithm is one of the most successful search
algorithms for the Traveling Salesman Problem (TSP). The core of LKH is a variable depth …

The Lin–Kernighan heuristic is known to be one of the most successful heuristics for the
Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some …

Abstract Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various
solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this …

We present and investigate a new method for the Traveling Salesman Problem (TSP) that
incorporates backbone information into the well known and widely applied Lin-Kernighan …

The Traveling Salesman Problem (TSP) is one of the most well-studied combinatorial
optimization problems. Best heuristics for solving the TSP known today are Lin-Kernighan …

This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman
problem (TSP). Existing approximation methods to address the TSP known to be state-of-the …

Traveling salesman problem (TSP) is a classical combinatorial optimization problem. As it
represents a large number of important practical problems, it has received extensive studies …