Skip to main content
SpringerLink
Log in

Solving the median problem with continuous demand on a network

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Where to locate one or several facilities on a network so as to minimize the expected users-closest facility transportation cost is a problem well studied in the OR literature under the name of median problem.

In the median problem users are usually identified with nodes of the network. In many situations, however, such assumption is unrealistic, since users should be better considered to be distributed also along the edges of the transportation network. In this paper we address the median problem with demand distributed along edges and nodes. This leads to a global-optimization problem, which can be solved to optimality by means of a branch-and-bound with DC bounds. Our computational experience shows that the problem is solved in short time even for large instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Bello, L., Blanquero, R., Carrizosa, E.: On minimax-regret Huff location models. Comput. Oper. Res. 38, 90–97 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athenas Scientific, Belmont (1998)

    MATH  Google Scholar 

  3. Blanquero, R., Carrizosa, E.: Optimization of the norm of a vector-valued DC function and applications. J. Optim. Theory Appl. 107, 245–260 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blanquero, R., Carrizosa, E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45, 389–402 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blanquero, R., Carrizosa, E., Hansen, P.: Locating objects in the plane using global optimization techniques. Math. Oper. Res. 34, 837–858 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brandeau, M.L., Chiu, S.S., Batta, R.: Locating the two-median of a tree network with continuous link demands. Ann. Oper. Res. 6, 223–253 (1986)

    Article  Google Scholar 

  7. Carrizosa, E., Conde, E., Muñoz-Márquez, M., Puerto, J.: The generalized Weber problem with expected distances. RAIRO. Rech. Opér. 29, 35–57 (1995)

    MATH  Google Scholar 

  8. Cavalier, T.M., Sherali, H.D.: Network location problem with continuous link demands: p-medians on a chain and 2-medians on a tree. Eur. J. Oper. Res. 23, 246–255 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Corberán, A., Sanchis, J.M.: A branch & cut algorithm for the windy general routing problem and special cases. Networks 49, 245–257 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1–43 (1999)

    Article  MathSciNet  Google Scholar 

  11. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)

    Book  MATH  Google Scholar 

  12. Chiu, S.S.: The minisum location problem on an undirected network with continuous link demands. Comput. Oper. Res. 14, 369–383 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. Larson, R.C., Odini, A.R.: Urban Operations Research. Prentice Hall, Englewood Cliffs (1981)

    Google Scholar 

  14. Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14, 699–719 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  15. López de los Mozos, M.C., Mesa, J.A.: The variance location problem on a network with continuously distributed demand. RAIRO. Rech. Opér. 34, 154–181 (2000)

    Google Scholar 

  16. Mitten, L.G.: Branch and bound methods: general formulation and properties. Oper. Res. 18, 24–34 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nkansah, P.T., David, H.T.: Network median problems with continuously distributed demand. Transp. Sci. 20, 213–219 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  18. Okabe, A., Okunuki, K., Shiode, S.: SANET: a toolbox for spatial analysis on a network. Geogr. Anal. 38, 57–66 (2006)

    Article  Google Scholar 

  19. Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network Voronoi diagrams: concepts, computational methods, and applications. Int. J. Geogr. Inf. Sci. 22, 965–994 (2008)

    Article  Google Scholar 

  20. Okabe, A., Satoh, T., Sugihara, K.: A kernel density estimation method for networks, its computational method and a GIS-based tool. Int. J. Geogr. Inf. Sci. 23, 7–32 (2009)

    Article  Google Scholar 

  21. Tuy, H.: DC optimization: theory, methods and algorithms. In: Handbook of Global Optimization, Kluwer Academic, Dordrecht (1995)

    Google Scholar 

  22. Tuy, H., Al-Khayyal, F., Zhou, F.: A d.c. optimization method for single facility location problems. J. Glob. Optim. 7, 209–227 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Xie, Z., Yan, J.: Kernel density estimation of traffic accidents in a network space. Comput. Environ. Urban Syst. 32, 396–406 (2008)

    Article  Google Scholar 

  24. Data instances for arc routing problems. Available at www.uv.es/corberan/instancias.htm

Download references

Author information

Authors and Affiliations

  1. Universidad de Sevilla, Seville, Spain

    Rafael Blanquero & Emilio Carrizosa

Authors
  1. Rafael Blanquero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emilio Carrizosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rafael Blanquero.

Additional information

Research supported by grants from the Spanish Ministry of Education, Culture and Sport MTM2009-14039-C06-06, Junta de Andalucía TIC-6064, FQM-329, in part financed by the European Regional Development Fund (ERDF).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blanquero, R., Carrizosa, E. Solving the median problem with continuous demand on a network. Comput Optim Appl 56, 723–734 (2013). https://doi.org/10.1007/s10589-013-9574-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-013-9574-3

Keywords

Search

Navigation