Fairness in maximal covering location problems

DOI10.1016/J.COR.2023.106287arXiv2204.06446MaRDI QIDQ6106589FDOQ6106589

Authors: Víctor Blanco, Ricardo Gázquez 

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Abstract: This paper provides a general mathematical optimization based framework to incorporate fairness measures from the facilities' perspective to Discrete and Continuous Maximal Covering Location Problems. The main ingredients to construct a function measuring fairness in this problem are the use of: (1) ordered weighted averaging operators, a family of aggregation criteria very popular to solve multiobjective combinatorial optimization problems; and (2) $alpha$-fairness operators which allow to generalize most of the equity measures. A general mathematical optimization model is derived which captures the notion of fairness in maximal covering location problems. The models are firstly formulated as mixed integer non-linear optimization problems for both the discrete and the continuous location spaces. Suitable mixed integer second order cone optimization reformulations are derived using geometric properties of the problem. Finally, the paper concludes with the results obtained on an extensive battery of computational experiments on real datasets. The obtained results support the convenience of the proposed approach.

Full work available at URL: https://arxiv.org/abs/2204.06446

Recommendations

• Fair optimization and networks: a survey
• On single-source capacitated facility location with cost and fairness objectives
• A kernel search heuristic for a fair facility location problem
• Proportional and maxmin fairness for the sensor location problem with chance constraints
• Editorial. Fair optimization and networks: models, algorithms, and applications

zbMATH Keywords

facility locationmixed integer non linear programmingfair resource allocationordered weighted averaging problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Operations research and management science (90Bxx) Discrete location and assignment (90B80) Continuous location (90B85)

Cites Work

• On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
• The bargaining problem
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• The price of fairness
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Location of Emergency Service Facilities
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Title not available (Why is that?)
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Fairness in routing and load balancing
• Equity measurement in facility location analysis: A review and framework
• An analytic approach for obtaining maximal entropy OWA operator weights
• On obtaining minimal variability OWA operator weights.
• On the properties of parametric geometric OWA operator
• A comparison of formulations and solution methods for the minimum-envy location problem
• Fair optimization and networks: a survey
• Continuous space maximal coverage: insights, advances and challenges
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Minimizing the sum of the \(k\) largest functions in linear time.
• On Low-Envy Truthful Allocations
• The maximin gradual cover location problem
• Multi-type maximal covering location problems: hybridizing discrete and continuous problems
• Analytic properties of maximum entropy OWA operators
• Optimal flows in networks with multiple sources and sinks
• Location science
• Equality measures properties for location problems
• Fair allocation using a fast smart market auction
• A consistent multidimensional Pigou-Dalton transfer principle
• Locating hyperplanes to fitting set of points: a general framework
• Title not available (Why is that?)
• On the multisource hyperplanes location problem to fitting set of points
• Fair resource allocation: using welfare-based dominance constraints
• Covering problems with polyellipsoids: a location analysis perspective
• Rawlsian fairness in push and pull supply chains
• Continuous maximal covering location problems with interconnected facilities

Cited In (3)

• On minimal extended representations of generalized power cones
• Improving spatial access to healthcare facilities: an integrated approach with spatial analysis and optimization modeling
• Proportional and maxmin fairness for the sensor location problem with chance constraints

This page was built for publication: Fairness in maximal covering location problems

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