Fairness in maximal covering location problems
From MaRDI portal
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) -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.
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
Cites work
- A comparison of formulations and solution methods for the minimum-envy location problem
- A consistent multidimensional Pigou-Dalton transfer principle
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An analytic approach for obtaining maximal entropy OWA operator weights
- Analytic properties of maximum entropy OWA operators
- Continuous maximal covering location problems with interconnected facilities
- Continuous space maximal coverage: insights, advances and challenges
- Covering problems with polyellipsoids: a location analysis perspective
- Equality measures properties for location problems
- Equity measurement in facility location analysis: A review and framework
- Fair allocation using a fast smart market auction
- Fair optimization and networks: a survey
- Fair resource allocation: using welfare-based dominance constraints
- Fairness in routing and load balancing
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 1253048 (Why is no real title available?)
- scientific article; zbMATH DE number 1138450 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- Locating hyperplanes to fitting set of points: a general framework
- Location science
- Minimizing the sum of the \(k\) largest functions in linear time.
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- On Low-Envy Truthful Allocations
- On obtaining minimal variability OWA operator weights.
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- On the multisource hyperplanes location problem to fitting set of points
- On the properties of parametric geometric OWA operator
- Optimal flows in networks with multiple sources and sinks
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Rawlsian fairness in push and pull supply chains
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- The bargaining problem
- The Location of Emergency Service Facilities
- The maximin gradual cover location problem
- The price of fairness
Cited in
(7)- Service allocation equity in location coverage analytics
- Proportional and maxmin fairness for the sensor location problem with chance constraints
- On minimal extended representations of generalized power cones
- Improving spatial access to healthcare facilities: an integrated approach with spatial analysis and optimization modeling
- On the complexity of p-order cone programs
- The cooperative maximal covering location problem with ordered partial attractions
- Optimization-based computation and integration of ordered measures
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)
