A scatter search heuristic for the capacitated clustering problem

DOI10.1016/j.ejor.2004.08.014zbMath1079.90180OpenAlexW2065928339MaRDI QIDQ2570154

Rolf Wendolsky, Stephan Scheuerer

Publication date: 26 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.014

zbMATH Keywords

MetaheuristicsScatter searchCapacitated \(p\)-median problemsCapacitated clustering problems

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (16)

STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES ⋮ Investigation of a new GRASP-based clustering algorithm applied to biological data ⋮ A matheuristic for large-scale capacitated clustering ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ An effective VNS for the capacitated \(p\)-median problem ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ Model-based capacitated clustering with posterior regularization ⋮ Optimization problems for machine learning: a survey ⋮ Clustering search algorithm for the capacitated centered clustering problem ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem ⋮ Matheuristics for the capacitated p‐median problem ⋮ Scatter search --- wellsprings and challenges ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand ⋮ Metaheuristic applications on discrete facility location problems: a survey

Uses Software

• OR-Library
• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• Efficient algorithms for the capacitated concentrator location problem
• A bionomic approach to the capacitated \(p\)-median problem
• A tabu search heuristic and adaptive memory procedure for political districting
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Hashing vectors for tabu search
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Scatter Search and Path Relinking: Advances and Applications
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Handbook of metaheuristics
• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: A scatter search heuristic for the capacitated clustering problem