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

DOI10.1016/J.COR.2004.04.009MaRDI QIDQ2387294zbMATHOpenAlexDBLPWikidataFDO

Authors 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

\(p\)-centerGRASPLocal searchLocationPath relinkingScatter search

Mathematics Subject Classification ID

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

Recommendations

• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Scatter search for the single source capacitated facility location problem
• A scatter search-based heuristic to locate capacitated transshipment points
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem

Cites work

• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2144390 (Why is no real title available?)
• scientific article; zbMATH DE number 894762 (Why is no real title available?)
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• A GRASP with path-relinking for private virtual circuit routing
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• A probabilistic heuristic for a computationally difficult set covering problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An experimental evaluation of a scatter search for the linear ordering problem
• Computing approximate solutions of the maximum covering problem with GRASP
• Fundamentals of scatter search and path relinking
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Minimizing labor requirements in a periodic vehicle loading problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Solving capacitated clustering problems
• Variable neighborhood search for the p-median

Cited in

(14)

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

Describes a project that uses

Uses Software

• OR-Library
• Scatter Search
• Tabu search

This page was built for publication: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

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