Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

DOI10.1016/j.cor.2004.04.009zbMath1146.90460OpenAlexW2052373803WikidataQ59760349 ScholiaQ59760349MaRDI QIDQ2387294

Joaquín Pacheco, Silvia Casado

Publication date: 2 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.009

zbMATH Keywords

GRASPLocation\(p\)-centerLocal searchPath relinkingScatter search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Scatter search for an uncapacitated \(p\)-hub median problem ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ Bee colony optimization for the \(p\)-center problem ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ Path relinking approach for multiple allocation hub maximal covering problem ⋮ Theoretical insights into the augmented-neural-network approach for combinatorial optimization ⋮ A MILP formulation for the reorganization of the blood supply chain in Italian regions ⋮ Memetic algorithms ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants ⋮ Metaheuristic applications on discrete facility location problems: a survey

Uses Software

• OR-Library
• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• A probabilistic heuristic for a computationally difficult set covering problem
• Computing approximate solutions of the maximum covering problem with GRASP
• An experimental evaluation of a scatter search for the linear ordering problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Minimizing labor requirements in a periodic vehicle loading problem
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Variable neighborhood search for the p-median
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• A GRASP with path-relinking for private virtual circuit routing