A reactive GRASP with path relinking for capacitated clustering

DOI10.1007/S10732-010-9129-ZMaRDI QIDQ535394zbMATH OpenOpenAlexFDO

Authors Y.-M. Deng, Jonathan F. Bard

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

variable neighborhood searchpath relinkingGRASPcapacitated clustering problem

Mathematics Subject Classification ID

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

Recommendations

• Heuristic search to the capacitated clustering problem
• A scatter search heuristic for the capacitated clustering problem
• Clustering search algorithm for the capacitated centered clustering problem
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Tabu search and GRASP for the capacitated clustering problem

Cites work

• scientific article; zbMATH DE number 3617544 (Why is no real title available?)
• scientific article; zbMATH DE number 2042280 (Why is no real title available?)
• A GRASP for parallel machine scheduling with time windows
• A GRASP for the Vehicle Routing Problem with Time Windows
• A column generation approach to capacitated \(p\)-median problems
• A new approach to the minimum cut problem
• A reactive GRASP and path relinking for a combined production-distribution problem
• Cliques and clustering: A combinatorial approach
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Fundamentals of scatter search and path relinking
• Genetic clustering algorithms.
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Greedy randomized adaptive search procedures
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
• Improving Discrete Model Representations via Symmetry Considerations
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• Min-cut clustering
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Solving capacitated clustering problems
• The capacitated centred clustering problem
• The node capacitated graph partitioning problem: A computational study
• Using clustering analysis in a capacitated location-routing problem
• Variable neighborhood search

Cited in

(13)

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

Describes a project that uses

Uses Software

• Scatter Search
• CPLEX
• J-MEANS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535394)