Department of Economics and Business Economics

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

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

A bi-objective approach to discrete cost-bottleneck location problems. / Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund.

In: Annals of Operations Research, Vol. 267, No. 1-2, 2018, p. 179-201.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

APA

CBE

MLA

Vancouver

Author

Bibtex

@article{76e6dc06e63548ee84cf568e34609d8c,
title = "A bi-objective approach to discrete cost-bottleneck location problems",
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 ε-constraint method that solves at most (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 ε-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 ε-constrained method and to the two phase method.",
keywords = "Bi-objective optimization, Discrete facility location, EPSILON-CONSTRAINT METHOD, FACILITY, GRAPH, Lexicographic optimization, MEDIAN CONVEX COMBINATION, NETWORK, OPTIMIZATION PROBLEMS, PRICE ALGORITHM, PROFITS, SWITCHING CENTERS, epsilon-Constrained method",
author = "Gadegaard, {Sune Lauth} and Andreas Klose and Nielsen, {Lars Relund}",
year = "2018",
doi = "10.1007/s10479-016-2360-8",
language = "English",
volume = "267",
pages = "179--201",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer New York LLC",
number = "1-2",

}

RIS

TY - JOUR

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

AU - Gadegaard, Sune Lauth

AU - Klose, Andreas

AU - Nielsen, Lars Relund

PY - 2018

Y1 - 2018

N2 - 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 ε-constraint method that solves at most (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 ε-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 ε-constrained method and to the two phase method.

AB - 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 ε-constraint method that solves at most (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 ε-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 ε-constrained method and to the two phase method.

KW - Bi-objective optimization

KW - Discrete facility location

KW - EPSILON-CONSTRAINT METHOD

KW - FACILITY

KW - GRAPH

KW - Lexicographic optimization

KW - MEDIAN CONVEX COMBINATION

KW - NETWORK

KW - OPTIMIZATION PROBLEMS

KW - PRICE ALGORITHM

KW - PROFITS

KW - SWITCHING CENTERS

KW - epsilon-Constrained method

U2 - 10.1007/s10479-016-2360-8

DO - 10.1007/s10479-016-2360-8

M3 - Journal article

AN - SCOPUS:84994702057

VL - 267

SP - 179

EP - 201

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1-2

ER -