Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives

Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect). We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results.

• Type: Journal
• Year: 2002
• Where: ANOR
• Authors: Horst W. Hamacher, Martine Labbé, Stefan Nickel, Anders J. V. Skriver
• Keywords: ANOR 2002, Minisum Problem, Multicriteria Network Location, Polynomial Time Algorithm