Multicriterial Planar Location Problems

  • Given Q different objective functions, three types of single-facility problems are considered: Lexicographic, pareto and max ordering problems. After discussing the interrelation between the problem types, a complete characterization of lexicographic locations and some instances of pareto and max ordering locations is given. The characterizations result in efficient solution algorithms for finding these locations. The paper relies heavily on the theory of restricted locations developed by the same authors, and can be further extended, for instance, to multifacility problems with several objectives. The proposed approach is more general than previously published results on multicriteria planar location problems and is particulary suited for modelling real-world problems.

Export metadata

Additional Services

Search Google Scholar
Author:H. W. Hamacher, S. Nickel
Series (Serial Number):Preprints (rote Reihe) des Fachbereich Mathematik (243)
Document Type:Report
Language of publication:English
Date of Publication (online):2017/10/16
Year of first Publication:1993
Publishing Institution:Technische Universit├Ąt Kaiserslautern
Date of the Publication (Server):2017/10/16
Page Number:32
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)