On the Use of Matching Algorithms to Transfer Solutions for the Travelling Salesperson Problem
Abstract
Multitasking evolutionary algorithms can be effectively used to solve a number of problems with a single population. A key issue in deciding their effectiveness, is how to transfer good solutions from one problem instance to another problem instance which shares some characteristics. We investigate in this paper how to transfer solutions between different problem instances of the Travelling Salesperson Problem (TSP) based matching algorithms and introduce different transfer mechanisms based on matching the nodes between problem instances. In our experimental study, we examine how the different transfer approaches perform for different classes of TSP instances dependent on the characteristics of the considered problem instances.
Authors: Liam Wigney, Aneta Neumann, Yew-Soon Ong, Frank Neumann
Published in: Genetic and Evolutionary Computation Conference (GECCO) (2025)