Modelos de localización de servicios no deseados en redes con múltiples criterios
-
1
Universidad de La Laguna
info
Publisher: Departamento de Estadística e Investigación Operativa, Universidad de Cádiz
ISBN: 84-689-0438-4
Year of publication: 2005
Pages: 437-438
Congress: XXVIII Congreso Nacional de Estadística e Investigación Operativa
Type: Conference paper
Abstract
Se analizan los modelos del centro no deseado y de la mediana no deseada en redes multicriterio, estableciendo nuevas propiedades que ca-racterizan las soluciones eficientes, as´ı como reglas para la eliminaci´on de aristas ineficientes. Asimismo, se presentan algunos resultados computa-cionales sobre redes aleatorias.
Bibliographic References
- [1] Church, R.L., Garfinkel, R.S. (1978) Locating an obnoxious facility on a network. Transportation Science 12(2), 107-118.
- [2] Colebrook, M., Guti´errez, J., Sicilia, J. (2005) A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks. Computers and Operations Research (en prensa).
- [3] Colebrook, M., Guti´errez, J., Alonso, S., Sicilia, J. (2002) A new algo-rithm for the undesirable 1-center problem on networks. Journal of the Operational Research Society 53(12), 1357-1366.
- [4] Erkut, E., Neuman, S. (1989) Analytical models for locating undesirable facilities. European Journal of Operational Research 40(3), 275-291.
- [5] Giannikos, I. (1998) A multiobjective programming model for locating treatment sites and routing hazardous wastes. European Journal of Ope-rational Research 104(2), 333-342.
- [6] Hamacher, H.W., Labb´e, M., Nickel, S., Skriver, A.J.V. (2002) Multicri-teria semi-obnoxious network location problems (MSNLP) with sum and center objectives. Annals of Operations Research 110(1-4), 33-53.
- [7] Minieka, E. (1983) Anticenters and antimedians of a network. Networks 13(3), 359-364.
- [8] Zhang, F.G., Melachrinoudis, E. (2001) The maximin-maxisum network location problem. Computational Optimization and Applications 19(2), 209-234.