Multicriteria planar location problems |
| |
| Affiliation: | 1. Departament de Matemàtiques, Universitat Jaume I, Campus de Riu Sec, E-12071, Castelló de la Plana, Spain;2. Departamento de Matemáticas, Universidad de Murcia, Campus Espinardo, 30100 Murcia, Spain;3. Departamento de Análisis Matemático, Apartado de Correos 1160, Sevilla, 41080, Spain;1. School of Information Science and Technology, Dalian Maritime University, Linghai Road 1, Dalian 116026, China;2. School of Information Science and Technology, Tokai University, 4-1-1 Kitakaname, Hiratsuka 259-1292, Japan |
| |
| Abstract: | 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 multi-facility problems with several objectives. The proposed approach is more general than previously published results on multicriteria planar location problems and is particularly suited for modelling real-world problems. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
