A memetic random key algorithm for the balanced travelling salesman problem

DOI10.1007/978-3-030-68520-1_2MaRDI QIDQ5011675zbMATH OpenOpenAlexFDO

Authors 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 searchmemetic algorithmstravelling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• A variable neighborhood search algorithm for cost-balanced travelling salesman problem
• A memetic algorithm for the generalized traveling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
• Solving of TSP with time restraints by memetic algorithm

Cites work

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

Cited in

(2)

• A variable neighborhood search algorithm for cost-balanced travelling salesman problem
• Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem

This page was built for publication: A memetic random key algorithm for the balanced travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011675)