A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
Summary: We describe a methodology that finds approximate and sometimes optimal solutions to the symmetric Travelling Salesman Problem (TSP) using a hybrid approach that combines a Random-Key Genetic Algorithm (RKGA) with a local search procedure. The random keys representation ensures that feasible tours are constructed during the application of genetic operators, whereas the genetic algorithm approach with local search efficiently generates optimal or near-optimal solutions. The results of experiments are provided that use examples taken from a well-known online library to confirm the quality of the proposed algorithm.
- Genetic algorithms for the traveling salesman problem
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
- A new genetic algorithm applied to the traveling salesman problem
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- A memetic random key algorithm for the balanced travelling salesman problem
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
This page was built for publication: A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885677)
