A hybrid metaheuristic for the clustered travelling salesman problem
type: Item
instance of: scholarly article
title: A hybrid metaheuristic for the clustered travelling salesman problem
DOI: 10.1007/978-3-031-24907-5_46
author: Abtin Nourmohammadzadeh
author: Stefan Voß
publication date: 2024-09-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7914483
zbMATH Keywords: clustered travelling salesman problem
zbMATH Keywords: hybrid metaheuristic
zbMATH Keywords: artificial bee colony algorithm
zbMATH Keywords: tabu search
MaRDI profile type: Publication
cites work: A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
cites work: An improved approximation algorithm for the clustered traveling salesman problem
cites work: Response Surfaces, Mixtures, and Ridge Analyses
cites work: Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
cites work: The symmetric clustered traveling salesman problem
cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
cites work: Least squares quantization in PCM
cites work: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
cites work: Q4350079
description: scientific article; zbMATH DE number 7914483