Multiobjective solution of the uncapacitated plant location problem

In this paper we consider the discrete multiobjective uncapacitated plant location problem. We present an exact and an approximate approach to obtain the set of non-dominated solutions. The two approaches resort to dynamic programming to generate in an efficient way the non-dominated solution sets. The solution methods that solve the problems are associated with the generated states are based on the decomposition of the problem on two nested subproblems. We define lower and upper bound sets that lead to elimination tests that have shown a high performance. Computational experiments on a set of test problems show the good performance of the proposal.