Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
Ist Teil von
Journal of the Operations Research Society of Japan, 2023/01/31, Vol.66(1), pp.37-55
Ort / Verlag
Tokyo: The Operations Research Society of Japan
Erscheinungsjahr
2023
Quelle
EZB Electronic Journals Library
Beschreibungen/Notizen
The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted distance between a facility and a set of demand points. Three new global optimal solution approaches are proposed. Two variants of the “Big Triangle Small Triangle” global optimization method, and a procedure based on intersection points between Apollonius circles. We also compared the results with a multi-start approach using the non-linear multi-purpose software SNOPT. Problems with 1,000 demand points are exactly solved in a fraction of a second of computer time.