Eficiencia versus equidad en localizaciónaplicación al diseño de infraestructuras

  1. Canós Darós, María José
  2. Mocholi Arce, Manuel
  3. Martínez Romero, María Luisa
Journal:
Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

ISSN: 1575-605X

Year of publication: 2009

Volume: 10

Issue: 1

Pages: 59-76

Type: Article

DIALNET GOOGLE SCHOLAR lock_openDialnet editor

More publications in: Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

Abstract

Location models in public and private sectors share the objective of optimizing any utility measure that satisfies some constraints, but they differ in how to establish the objective and the constraints. Decisions in the private sector involve a big amount of characteristics, including non-economic ones, but they assume, as a reasonable objective, minimizing the cost or maximizing the profit. Public location decisions are answers to social demands and the objective in this case is to maximize a benefit or to minimize a cost non-based in monetary terms. This idea leads to the inclusion of the concept of a compromise solution, namely pcentdian that is a convex combination between p-median (efficiency) and p-center (equity). In this paper we solve de p-centdian problem by using mathematical programming models. We use these models to locate some facilities in Kinshasa.

Bibliographic References

  • BERMAN, O. Y YANG, E.K. (1991), “Medi-centre location problems”, Journal of the Operational Research Society, 42, pp. 313-322.
  • CANÓS, M.J., MARTÍNEZ, M. Y MOCHOLÍ, M. (2005). “Un Algoritmo para el Cálculo del Conjunto Dominante Finito del Problema Generalizado de la p-Centdiana”. Recta, 6, pp. 87-112
  • CHURCH, R. Y REVELLE, C. (1974). “The Maximal Covering Location Problem”. Papers of the Regional Science Association, 32, pp. 101-118.
  • COOPER, L. (1963). “Location-Allocation Problems”. Operations Research, 11, pp. 331-343.
  • GERRARD, R.A. Y CHURCH, R.L. (1995). “General Construct for the Zonally Constrained p-Median problem”. Environment and Planning B: Planning and Design, 22, pp. 213-236.
  • GOLDMAN, A.J. (1975). “Concepts of Optimal Location for Partially Noxious Facilities”. ORSA Bulletin, 23, pp. B-31.
  • GHOSH, J.B. (1996), “Siting Facilities Along A Line When Equity Of Service Is Desirable”, Journal Of Operational Research Society, Vol. 47, Pp. 435-445.
  • HAKIMI, S.L. (1964). “Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph”. Operations Research, 12, pp. 450-459.
  • HAKIMI, S.L. (1965). “Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems”. Operations Research, 13, pp. 462-475.
  • HALPERN, J. (1976), “The location of a center-median convex combination on an undirected tree”, Journal of Regional Science, vol. 16, pp. 237-245.
  • HALPERN, J. (1978), “Finding minimal center-median convex combination (cent-dian) of a graph”, Management Science, vol. 24, pp. 535-544.
  • HALPERN, J. (1980), “Duality in the cent-dian of a graph”, Operations Research, vol. 28, pp. 722-735.
  • HANDLER, G.Y. (1985), “Medi-centers of a tree”, Transportation Science, vol. 19, pp. 246-260.
  • HANSEN, P.; LABBÉ, M. Y THISSE, J.F. (1991), “From the median to the generalized center”, RAIRO, vol. 25, pp. 73-86.
  • ISARD, W. Location and Space Economy, Technology Press, MIT, Cambridge, Massachussets, 1962.
  • KUTANGILA, D. (2005): “Modelos basados en soft computing para resolver problemas de localización”, tesis doctoral, Universidad de Granada.
  • MANSFIELD, E. Y WEIN, H.H. (1958). “A Model for the Location of a Railroad Classification Yard”. Management Science, 4, pp. 292-313.
  • MARTINEZ ROMERO, M (2005): “Eficiencia y equidad en problemas de localización sobre redes”, tesis doctoral, Universidad de Valencia.
  • MIEHLE, W. (1958). “Link-Lenght Minimization in Networks”. Operations Research, 6, pp. 232-243.
  • OGRYCZAK, W. (1997), “On cent-dians of general networks”, Location Science, vol. 5, pp. 15-28.
  • PÉREZ BRITO, D. Y MORENO PÉREZ, J. A. (2000): "The generalized p-centdian on network”. Top, Vol. 8, No. 2, pp. 265-285
  • PÉREZ BRITO, D.; MORENO PÉREZ, J.A. Y RODRÍGUEZ MARTÍN, I. (1997), “Finite dominating set for the p-facility cent-dian network location problem”, Studies in Locational Analysis, vol. 11, pp. 27-40.
  • PREDÖHL, A. (1928). “The Theory of Location in its Relation to General Economics”. Journal of Political Economy, 36, pp. 371-390.
  • REVELLE, C.S.; EISELT, H.A. Y DASKIN, M.S. (2008) “A bibliography for some fundamental problem categories in discrete location science”, European Journal of Operational Research, Vol. 184, pp. 817-848.
  • REVELLE, C.S., MARKS, D.H. Y LIEBMAN, J.C. (1977). “An Analysis of Private and Public Sector Location Models”. Management Science, 16, pp. 692-707.
  • SHIER, D.R. Y DEARING, P.M. (1983), “Optimal locations for a class of non-linear, single-facility location problems on a network”, Operations Research, vol. 31, pp. 292- 303.
  • TAMIR, A.; PÉREZ BRITO, D. Y MORENO PÉREZ, J.A. (1998), “A polynomial algorithm for the p-centdian on a tree”, Networks, vol. 32, pp. 255-262.
  • VALINSKY, D. (1955). “A Determination of the Optimum Location of Fire-Fighting Units in New York City”. Operations Research, 3, pp. 494-512.
  • WEBER, A., Theory of the Location of Industries, Russell ans Russell, Nueva York, USA, 1971, (traducción efectuada por C.J. Friedrich de: A. Weber, Über den Standort der Industrien, Tübingen, 1909).
Data source: Dialnet