Location Problems with Multiple Criteria
- 50 Downloads
This chapter analyzes multicriteria continuous, network, and discrete location problems. In the continuous framework, we provide a complete description of the set of weak Pareto, Pareto, and strict Pareto locations for a general Q-criteria location problem based on the characterization of three criteria problems. In the network case, the set of Pareto locations is characterized for general networks as well as for tree networks using the concavity and convexity properties of the distance function on the edges. In the discrete setting, the entire set of Pareto locations is characterized using rational generating functions of integer points in polytopes. Moreover, we describe algorithms to obtain the solutions sets (the different Pareto locations) using the above characterizations. We also include a detailed complexity analysis. A number of references has been cited throughout the chapter to avoid the inclusion of unnecessary technical details and also to be useful for a deeper analysis.
KeywordsPareto-optimal Pareto locations Level curves Tree networks Networks Rational functions
The authors were partially supported by projects MTM2016-74983-C2-01/02-R (Ministry of Science, Innovation and Universities∖FEDER, Spain).
- Drezner Z (1995) Facility location. In: A survey of applications and methods. Springer, New YorkGoogle Scholar
- Ehrgott M, Gandibleux X (2002) Multiple criteria optimization. In: State of the art annotated bibliographic surveys. Kluwer, BostonGoogle Scholar
- Nickel S (1995) Discretization of planar location problems. Fachbereich mathematik, PhD Dissertation, University of KaiserslauternGoogle Scholar
- Nickel S, Puerto J, Rodríguez-Chía AM (2005a) MCDM location problems. In: Figueira JA, Greco S, Ehrogott M (eds) Multiple criteria decision analysis: state of the art surveys, international series in operations research & management science, vol 78. Springer, New York, pp 761–787Google Scholar
- Verdoolaege S (2008) Software barvinok. http://freecode.com/projects/barvinok
- Wang SC, Lin CC, Chen TC, Hsiao H (2018) Multi-objective competitive location problem with distance-based attractiveness for two facilities. Comput Electr Eng 71:37–250Google Scholar
- Weissler A (1999) General bisectors and their application in planar location theory. Shaker, AachenGoogle Scholar
- Woods K, Yoshida R (2005) Short rational generating functions and their applications to integer programming. SIAG/OPT Views and News 16:15–19Google Scholar