Your conditions: Control and Optimization.
  • A minimum-envy location problem for spatial equality of public service: model formulation and case analysis

    Subjects: Geosciences >> Geography Subjects: Mathematics >> Control and Optimization. submitted time 2023-05-13

    Abstract: Location problems have been widely applied to service planning of public health, compulsory education, emergency management, and delivery logistics. However, the mainstream location models are usually to optimize the efficiency objectives such as travel cost, facility cost and the number of customs to be served, rather than the equality objectives. A few location models aim to optimize one of the equality measures, such as the variance of distances, the deviation of distances, the Gini coefficient between the travel distances, and the variance of spatial accessibility indexes. However, the facility locations, capacities and their service areas can be easily distorted by most equality-oriented objective functions. In this paper, a spatially envy objective function for service equality is proposed to overcome the shortcomings of commonly used equality functions. The envy value of customers at a location is determined by their travel distance that beyond a predefined distance. The envy function can be added to mainstream location models in a weighted manner. As a result, the capacitated p-median problem (CPMP) is enhanced as CPMP-envy. The original and improved models were tested on three large instances. Case experiments show that the equality measures, such as maximum travel distance, variance of distances, coefficient of variation, and Gini coefficient between travel distances, can be substantially improved by minimizing the weighted sum of spatial envy and travel cost. It is argued that the envy indicator has theoretical and practical potentials in facility planning towards spatial equality of public service.

  • The Equal Districting Problem: Model, Algorithm and Applications

    Subjects: Geosciences >> Geography Subjects: Mathematics >> Control and Optimization. submitted time 2021-02-24

    Abstract: Districting problems have been widely applied in geography, economics, environmental science, politics, business, public service and many other areas. The equal districting problem (EDP) arises in applications such as political redistricting, police patrol area delineation, sales territory design and some service area design. The important criteria for these problems are district equality, contiguity and compactness. A mixed integer linear programming (MILP) model and a hybrid algorithm are proposed for the EDP. The hybrid algorithm is designed by extending iterative local search (ILS) algorithm with three schemes: population-based ILS, variable neighborhood descent (VND) local search, and set partitioning. The performance of the algorithm was tested on five areas. Experimentation showed that the instances could be solved effectively and efficiently. The potential applications of the EDP in emergency services are also discussed.