A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem

DOI10.1007/978-3-030-68520-1_2zbMath1476.90278OpenAlexW3131259736MaRDI QIDQ5011675

Ayse Aslan

Publication date: 27 August 2021

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-68520-1_2

zbMATH Keywords

local searchtravelling salesman problemmemetic algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A random-key genetic algorithm for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem