Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Horst Hamacher,
Martine Labbé,
Stefan Nickel and
Anders Skriver ()
Annals of Operations Research, 2002, vol. 110, issue 1, 33-53
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. Copyright Kluwer Academic Publishers 2002
Keywords: MCDM; multicriteria; obnoxious; semi-obnoxious; facility location; networks (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020707315345 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:110:y:2002:i:1:p:33-53:10.1023/a:1020707315345
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1020707315345
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().