Metaheuristics for the tabu clustered traveling salesman problem
type: Item
instance of: scholarly article
title: Metaheuristics for the tabu clustered traveling salesman problem
zbMATH Open document ID: 1391.90540
author: Tianjiao Zhang
author: Liangjun Ke
author: Jing Li
author: Jingqi Huang
author: Zexi Li
author: Ji-Sheng Li
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901494
zbMATH Keywords: tabu clustered traveling salesman problem
zbMATH Keywords: TT\&C resources scheduling problem
zbMATH Keywords: ant colony optimization
zbMATH Keywords: greedy randomized adaptive search procedure
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2017.07.008
OpenAlex ID: W2735793097
cites work: Scheduling space-ground communications for the air force satellite control network
cites work: A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Q4352217
cites work: The traveling salesman problem and its variations
cites work: The symmetric clustered traveling salesman problem
cites work: Some applications of the clustered travelling salesman problem
cites work: Procedures for travelling salesman problems with additional constraints
cites work: A Lagrangian heuristic for satellite range scheduling with resource constraints
cites work: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
cites work: A general heuristic for vehicle routing problems
cites work: Q4350079
cites work: Q4377051
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
cites work: A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
DOI: 10.1016/J.COR.2017.07.008
description: scientific article; zbMATH DE number 6901494