A reactive GRASP with path relinking for capacitated clustering

DOI10.1007/s10732-010-9129-zzbMath1211.90301OpenAlexW2047569698MaRDI QIDQ535394

Jonathan F. Bard, Yumin Deng

Publication date: 11 May 2011

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-010-9129-z

zbMATH Keywords

GRASPvariable neighborhood searchpath relinkingcapacitated clustering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Heuristic search to the capacitated clustering problem ⋮ Multi-neighborhood based path relinking for two-sided assembly line balancing problem ⋮ A matheuristic for large-scale capacitated clustering ⋮ Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ Tabu search and GRASP for the capacitated clustering problem ⋮ Capacitated clustering problems applied to the layout of IT-teams in software factories ⋮ Local search algorithms for the composite retrieval problem ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ Solving the capacitated clustering problem with variable neighborhood search ⋮ Model-based capacitated clustering with posterior regularization ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products

Uses Software

• J-MEANS
• CPLEX
• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Solving capacitated clustering problems
• Using clustering analysis in a capacitated location-routing problem
• A reactive GRASP and path relinking for a combined production-distribution problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Cliques and clustering: A combinatorial approach
• The node capacitated graph partitioning problem: A computational study
• Min-cut clustering
• Variable neighborhood search
• A column generation approach to capacitated \(p\)-median problems
• Greedy randomized adaptive search procedures
• The capacitated centred clustering problem
• A GRASP for Parallel Machine Scheduling with Time Windows
• Improving Discrete Model Representations via Symmetry Considerations
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• A new approach to the minimum cut problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• A GRASP for the Vehicle Routing Problem with Time Windows
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
• Genetic clustering algorithms.
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: A reactive GRASP with path relinking for capacitated clustering