We introduce an experimentation procedure for evaluating and comparing optimization
algorithms based on the Traveling Salesman Problem (TSP). We argue that end-of-run …

This paper presents a genetic algorithm (GA) for solving the traveling salesman problem
(TSP). To construct a powerful GA, we use edge assembly crossover (EAX) and make …

Abstract The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial
optimization problem, for which a large variety of evolutionary algorithms are known …

This work presents a new metaheuristic for the euclidean Traveling Salesman Problem
(TSP) based on an Anytime Automatic Algorithm Selection model using a portfolio of five …

We propose an evolutionary algorithm (EA) that applies to the traveling salesman problem
(TSP). The EA uses edge assembly crossover (EAX), which is known to be efficient and …

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 …

Abstract The Travelling Salesman Problem (TSP) is a well-known optimisation problem that
has been widely studied over the last century. As a result, a variety of exact and approximate …

Evolutionary algorithms have successfully been applied to evolve problem instances that
exhibit a significant difference in performance for a given algorithm or a pair of algorithms …

With this paper we contribute to the understanding of the success of 2-opt based local
search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely …

This paper presents a new solver for the exactly one-in-a-set Generalized Traveling
Salesman Problem (GTSP). In the GTSP, we are given as input a complete directed graph …