Fair facility allocation in emergency service system

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23510%2F20%3A43958677" target="_blank" >RIV/49777513:23510/20:43958677 - isvavai.cz</a>

Výsledek na webu

<a href="https://journals.vgtu.lt/index.php/JBEM/article/view/12823/9979" target="_blank" >https://journals.vgtu.lt/index.php/JBEM/article/view/12823/9979</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3846/jbem.2020.12823" target="_blank" >10.3846/jbem.2020.12823</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Fair facility allocation in emergency service system

Popis výsledku v původním jazyce

The request of equal accessibility must be respected to some extent when dealing with problems of designing or rebuilding of emergency service systems. Not only the disutility of the average user but also the disutility of the worst situated user must be taken into consideration. Respecting this principle is called fairness of system design. Unfairness can be mitigated to a certain extent by an appropriate fair allocation of additional facilities among the centres. In this article, two criteria of collective fairness are defined in the connection with the facility allocation problem. To solve the problems, we suggest a series of fast algorithms for solving of the allocation problem. This article extends the family of the original solving techniques based on branch-and-bound principle by newly suggested techniques, which exploit either dynamic programming principle or convexity and monotony of decreasing nonlinearities in objective functions. The resulting algorithms were tested and compared performing numerical experiments with real-sized problem instances. The new proposed algorithms outperform the original approach. The suggested methods are able to solve general min-sum and min-max problems, in which a limited number of facilities should be assigned to individual members from a finite set of providers.

Název v anglickém jazyce

Fair facility allocation in emergency service system

Popis výsledku anglicky

The request of equal accessibility must be respected to some extent when dealing with problems of designing or rebuilding of emergency service systems. Not only the disutility of the average user but also the disutility of the worst situated user must be taken into consideration. Respecting this principle is called fairness of system design. Unfairness can be mitigated to a certain extent by an appropriate fair allocation of additional facilities among the centres. In this article, two criteria of collective fairness are defined in the connection with the facility allocation problem. To solve the problems, we suggest a series of fast algorithms for solving of the allocation problem. This article extends the family of the original solving techniques based on branch-and-bound principle by newly suggested techniques, which exploit either dynamic programming principle or convexity and monotony of decreasing nonlinearities in objective functions. The resulting algorithms were tested and compared performing numerical experiments with real-sized problem instances. The new proposed algorithms outperform the original approach. The suggested methods are able to solve general min-sum and min-max problems, in which a limited number of facilities should be assigned to individual members from a finite set of providers.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

50202 - Applied Economics, Econometrics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Business Economics and Management

ISSN

1611-1699

e-ISSN

—

Svazek periodika

21

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

LT - Litevská republika

Počet stran výsledku

14

Strana od-do

1058-1071

Kód UT WoS článku

000544343700006

EID výsledku v databázi Scopus

2-s2.0-85087453194