A novel optimization model for designing compact, balanced, and contiguous healthcare districts
- 17 June 2019
- journal article
- research article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 71 (11) , 1740-1759
Abstract
In this study, we propose a new multi-objective mathematical model for designing compact, balanced, and contiguous districts in healthcare systems. The objective functions minimize districting heterogeneity and the implementation cost of monitoring plans for promoting hygiene and public health. Expert teams perform these plans periodically by maximizing the coverage area. The purpose of the districting problem is to specify how teams are formed and allocated based on their service provision capacity and type of expertise. Improper team allocation and unsuitable service provision cause an increase in time and costs, fostering an adverse effect on the promotion of public health in the area. Compliance of the plan with the specified requirements and its implementation cost are the main factors impacting the districting problem decisions. We define two meta-heuristic algorithms including a multi-objective genetic algorithm II (NSGAII) and a multi-objective grey wolf optimizer (MOGWO) for solving the mathematical model in a real-scale because districting problems are NP-hard problems. We also present a case study taking place at a university medical centre in Iran to demonstrate the applicability and efficacy of the proposed model.Keywords
This publication has 47 references indexed in Scilit:
- Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizersComputers & Operations Research, 2012
- Spatial Aggregation and Compactness of Census Areas with a Multiobjective Genetic Algorithm: A Case Study in CanadaEnvironment and Planning B: Planning and Design, 2012
- Graph partitioning by multi-objective real-valued metaheuristics: A comparative studyApplied Soft Computing, 2011
- A mini–max spanning forest approach to the political districting problemInternational Journal of Systems Science, 2009
- A new modeling and solution approach for the set-partitioning problemComputers & Operations Research, 2008
- Designing delivery districts for the vehicle routing problem with stochastic demandsEuropean Journal of Operational Research, 2007
- A tabu search heuristic and adaptive memory procedure for political districtingEuropean Journal of Operational Research, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- A simulated annealing approach to police district designComputers & Operations Research, 2002
- Optimization Using Simulated AnnealingJournal of the Royal Statistical Society: Series D (The Statistician), 1995