Tabu search and GRASP for the capacitated clustering problem

DOI10.1007/s10589-015-9749-1zbMath1334.90190OpenAlexW2113215688MaRDI QIDQ887182

Rafael Martí, Micael Gallego, Vicente Campos, Anna Martínez-Gavara, Manuel Laguna

Publication date: 28 October 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-015-9749-1

zbMATH Keywords

tabu searchGRASPgraph partitioningcapacitated clusteringdiversity problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

Heuristic search to the capacitated clustering problem, Heuristics for the constrained incremental graph drawing problem, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, Capacitated clustering problems applied to the layout of IT-teams in software factories, A general framework for nested variable neighborhood search, Solving the capacitated clustering problem with variable neighborhood search

Uses Software

• GRASP
• PERL
• TTTPLOTS
• Tabu search

Cites Work

• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• A reactive GRASP with path relinking for capacitated clustering
• The node capacitated graph partitioning problem: A computational study
• TTT plots: a perl program to create time-to-target plots
• Hybrid heuristics for the maximum diversity problem
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• An empirical comparison of heuristic methods for creating maximally diverse groups
• An annotated bibliography of GRASP – Part I: Algorithms
• One-Half Approximation Algorithms for the k-Partition Problem