A bi-objective approach to discrete cost-bottleneck location problems

Sune Lauth Gadegaard (), Andreas Klose and Lars Relund Nielsen
Additional contact information
Sune Lauth Gadegaard: Aarhus University
Andreas Klose: Aarhus University
Lars Relund Nielsen: Aarhus University

Annals of Operations Research, 2018, vol. 267, issue 1, No 10, 179-201

Abstract: Abstract This paper considers a family of bi-objective discrete facility location problems with a cost objective and a bottleneck objective. A special case is, for instance, a bi-objective version of the (vertex) p-centdian problem. We show that bi-objective facility location problems of this type can be solved efficiently by means of an $$\varepsilon $$ ε -constraint method that solves at most $$(n-1)\cdot m$$ ( n - 1 ) · m minisum problems, where n is the number of customer points and m the number of potential facility sites. Additionally, we compare the approach to a lexicographic $$\varepsilon $$ ε -constrained method that only returns efficient solutions and to a two-phase method relying on the perpendicular search method. We report extensive computational results obtained from several classes of facility location problems. The proposed algorithm compares very favorably to both the lexicographic $$\varepsilon $$ ε -constrained method and to the two phase method.

Keywords: Discrete facility location; Bi-objective optimization; $$\varepsilon $$ ε -Constrained method; Lexicographic optimization (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2360-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:267:y:2018:i:1:d:10.1007_s10479-016-2360-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2360-8

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().