Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives |
| |
Authors: | Horst W Hamacher Martine Labbé Stefan Nickel Anders JV Skriver |
| |
Institution: | (1) Fachbereich Mathematik, Universität Kaiserslautern, Kurt-Schumacher-Strasse 26, 67663 Kaiserslautern, Germany;(2) Service de Mathématiques de la Gestion, Université Libré de Bruxelles, Brussels, Belgium;(3) ITWM, Universität Kaiserslautern, Ottlieb-Daimler-Strasse, Gebäude 49, 67663 Kaiserslautern, Germany;(4) Department of Operations Research, University of Aarhus, Building 530, Ny Munkegade, 8000 Århus C, Denmark |
| |
Abstract: | 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. |
| |
Keywords: | MCDM multicriteria obnoxious semi-obnoxious facility location networks |
本文献已被 SpringerLink 等数据库收录! |
|