Optimizing Treatment Facility Locations in Oklahoma Using Haversine, Euclidean, Manhattan, and Chebyshev Distance Optimization
摘要
In this study, we are optimizing the treatment facility locations in the eight regions of Oklahoma based on the homeland security map. Drug court data was used for each county in Oklahoma to optimize the placement of treatment facilities. The objectives of this model are to optimally place treatment facilities minimizing cost, total of various distance metrics and maximizing the total number of facilities located in each region, while not exceeding the number of facilities allowed to be located according to the maximum covering location problem. An integer priority based multi-criteria nonlinear programming model is utilized with several models comparing the results with and without fairness constraints, using fairness measures such as Hoover index and Gini coefficient at various thresholds. Gurobi was the solver used to solve each model. The Euclidean, Haversine, Manhattan, and Chebyshev distance metrics are used and compared to see which metric performs the best when coupled with Hoover and Gini index fairness measures.