A hybrid metaheuristic for the clustered travelling salesman problem

DOI10.1007/978-3-031-24907-5_46MaRDI QIDQ6606574FDOQ6606574

Authors: Abtin Nourmohammadzadeh, Stefan Voß 

Publication date: 17 September 2024

zbMATH Keywords

tabu searchartificial bee colony algorithmhybrid metaheuristicclustered travelling salesman problem

Mathematics Subject Classification ID

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

Cites Work

• Least squares quantization in PCM
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
• Title not available (Why is that?)
• The symmetric clustered traveling salesman problem
• Response Surfaces, Mixtures, and Ridge Analyses
• An improved approximation algorithm for the clustered traveling salesman problem

This page was built for publication: A hybrid metaheuristic for the clustered travelling salesman problem

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