Full metadata record
DC FieldValueLanguage
dc.contributor.authorJanáček, Jaroslav
dc.contributor.authorGábrišová, Lýdia
dc.contributor.authorPlevný, Miroslav
dc.date.accessioned2020-08-31T10:00:22Z-
dc.date.available2020-08-31T10:00:22Z-
dc.date.issued2020
dc.identifier.citationJANÁČEK, J., GÁBRIŠOVÁ, L., PLEVNÝ, M. Fair facility allocation in emergency service system. Journal of Business Economics and Management, 2020, roč. 21, č. 4, s. 1058-1071. ISSN 1611-1699.en
dc.identifier.issn1611-1699
dc.identifier.uri2-s2.0-85087453194
dc.identifier.urihttp://hdl.handle.net/11025/39545
dc.format14 s.
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVilnius Gediminas Technical University Pressen
dc.relation.ispartofseriesJournal of Business Economics and Managementen
dc.rights© Vilnius Gediminas Technical University Pressen
dc.titleFair facility allocation in emergency service systemen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedThe 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.en
dc.subject.translatedemergency system designen
dc.subject.translatedcollective fairnessen
dc.subject.translatedequal accessibilityen
dc.subject.translatedallocation problemen
dc.subject.translateddynamic programmingen
dc.subject.translatedpolynomial approachen
dc.identifier.doi10.3846/jbem.2020.12823
dc.type.statusPeer-revieweden
dc.identifier.document-number544343700006
dc.identifier.obd43929676
dc.project.IDSGS-2018-042/Aplikace kvantitativních metod v ekonomiics
Appears in Collections:Články / Articles (KEM)
OBD

Files in This Item:
File SizeFormat 
12823-Article Text-39540-3-10-20200602.pdf267,81 kBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/39545

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

search
navigation
  1. DSpace at University of West Bohemia
  2. Publikační činnost / Publications
  3. OBD