Uncapacitated facility location problem with self-serving demands

Abstract

In classical uncapacitated facility location problems (UFLP) the goal is to satisfy require- ments of some demand points by setting up some servers, among potential facility locations, such that the total cost including service costs and xed costs are minimized. In this paper a generalization of UFLP is considered in which some demand points, called self-serving, could be served exclusively by a new server at that point. Numerical experiments show that near optimal solutions are achieved by the proposed method.

Key words: Location problems, generalization of uncapacitated facility location problem, dual-ascent.