Threshold robustness in discrete facility location problems: a bi-objective approach

Abstract

Listen

Translate article

The two best studied facility location problems are the \(p\)-median problem and the uncapacitated facility location problem (Daskin, Network and discrete location: models, algorithms, and applications. Wiley, New York, 1995; Mirchandani and Francis, Discrete location theory. Wiley, New York, 1990). Both seek the location of the facilities minimizing the total cost, assuming no uncertainty in costs exists, and thus all parameters are known. In most real-world location problems the demand is not certain, because it is a long-term planning decision, and thus, together with the minimization of costs, optimizing some robustness measure is sound. In this paper we address bi-objective versions of such location problems, in which the total cost, as well as the robustness associated with the demand, are optimized. A dominating set is constructed for these bi-objective nonlinear integer problems via the \(\varepsilon \)-constraint method. Computational results on test instances are presented, showing the feasibility of our approach to approximate the Pareto-optimal set.