CSRX: A novel Crossover Operator for a Genetic Algorithm applied to the Traveling Salesperson Problem

03/22/2023
by   Martin Uray, et al.
0

In this paper, we revisit the application of Genetic Algorithm (GA) to the Traveling Salesperson Problem (TSP) and introduce a family of novel crossover operators that outperform the previous state of the art. The novel crossover operators aim to exploit symmetries in the solution space, which allows us to more effectively preserve well-performing individuals, namely the fitness invariance to circular shifts and reversals of solutions. These symmetries are general and not limited to or tailored to TSP specifically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/14/2020

New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem

Traveling salesman problem (TSP) is a well-known in computing field. The...
research
11/01/2017

An Adaptive Genetic Algorithm for Solving N-Queens Problem

In this paper a Metaheuristic approach for solving the N-Queens Problem ...
research
02/07/2007

Genetic Representations for Evolutionary Minimization of Network Coding Resources

We demonstrate how a genetic algorithm solves the problem of minimizing ...
research
03/19/2010

Nurse Rostering with Genetic Algorithms

In recent years genetic algorithms have emerged as a useful tool for the...
research
05/25/2020

Generating Modern Poetry Automatically in Finnish

We present a novel approach for generating poetry automatically for the ...
research
11/11/2012

Genetic Algorithm for Designing a Convenient Facility Layout for a Circular Flow Path

In this paper, we present a heuristic for designing facility layouts tha...
research
11/25/2021

Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm

We consider the optimization problem of constructing a binary orthogonal...

Please sign up or login with your details

Forgot password? Click here to reset