Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

DOI10.1007/978-3-319-73441-5_36zbMath1437.90136arXiv1706.06920OpenAlexW3105115774MaRDI QIDQ3297452

Julia Viktorovna Kovalenko, Anton Valentinovich Eremeev

Publication date: 20 July 2020

Published in: Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06920

zbMATH Keywords

local searchgenetic algorithmoptimal recombination

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of dynamic programming in genetic algorithms for permutation problems
• A new memetic algorithm for the asymmetric traveling salesman problem
• The algebra of genetic algorithms
• Tour Merging via Branch-Decomposition
• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Local Search for the Asymmetric Traveling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• Feature Article—Genetic Algorithms for the Operations Researcher
• The Traveling Salesman Problem for Cubic Graphs

This page was built for publication: Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem