An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
DOI10.3934/jimo.2018182zbMath1449.90189OpenAlexW2908276785WikidataQ128644236 ScholiaQ128644236MaRDI QIDQ781099
Roger Z. Ríos-Mercado, Rodolfo Mendoza-Gómez, Karla B. Valenzuela-Ocaña
Publication date: 16 July 2020
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018182
integer programmingvariable neighborhood descenthybrid metaheuristicsiterated greedy algorithmhealthcare planning
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Medical applications (general) (92C50) Discrete location and assignment (90B80) Consumer behavior, demand theory (91B42)
Cites Work
- Unnamed Item
- Unnamed Item
- Location-allocation approaches for hospital network planning under uncertainty
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
- Variable neighborhood search
- A survey of healthcare facility location
- Variable neighborhood decomposition search
- The parallel variable neighborhood search for the \(p\)-median problem
- Hybrid metaheuristic method for determining locations for long-term health care facilities
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A double VNS heuristic for the facility location and pricing problem
- Variable neighborhood search for the p-median
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
This page was built for publication: An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
