IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v235y2014i3p484-493.html
   My bibliography  Save this article

The multicriteria p-facility median location problem on networks

Author

Listed:
  • Kalcsics, Jörg
  • Nickel, Stefan
  • Pozo, Miguel A.
  • Puerto, Justo
  • Rodríguez-Chía, Antonio M.

Abstract

In this paper we discuss the multicriteria p-facility median location problem on networks with positive and negative weights. We assume that the demand is located at the nodes and can be different for each criterion under consideration. The goal is to obtain the set of Pareto-optimal locations in the graph and the corresponding set of non-dominated objective values. To that end, we first characterize the linearity domains of the distance functions on the graph and compute the image of each linearity domain in the objective space. The lower envelope of a transformation of all these images then gives us the set of all non-dominated points in the objective space and its preimage corresponds to the set of all Pareto-optimal solutions on the graph. For the bicriteria 2-facility case we present a low order polynomial time algorithm. Also for the general case we propose an efficient algorithm, which is polynomial if the number of facilities and criteria is fixed.

Suggested Citation

  • Kalcsics, Jörg & Nickel, Stefan & Pozo, Miguel A. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2014. "The multicriteria p-facility median location problem on networks," European Journal of Operational Research, Elsevier, vol. 235(3), pages 484-493.
    • Handle: RePEc:eee:ejores:v:235:y:2014:i:3:p:484-493
    DOI: 10.1016/j.ejor.2014.01.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714000058
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.01.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bitran, Gabriel R & Lawrence, Kenneth D, 1980. "Locating service offices: a multicriteria approach," Omega, Elsevier, vol. 8(2), pages 201-206.
    2. JosÉ Figueira & Salvatore Greco & Matthias Ehrogott, 2005. "Multiple Criteria Decision Analysis: State of the Art Surveys," International Series in Operations Research and Management Science, Springer, number 978-0-387-23081-8, December.
    3. Stefan Nickel & Justo Puerto & Antonio M. Rodríguez-Chía, 2005. "MCDM Location Problems," International Series in Operations Research & Management Science, in: Multiple Criteria Decision Analysis: State of the Art Surveys, chapter 0, pages 761-787, Springer.
    4. Skriver, Anders J. V. & Andersen, Kim Allan & Holmberg, Kaj, 2004. "Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives," European Journal of Operational Research, Elsevier, vol. 156(3), pages 541-549, August.
    5. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    6. Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1982. "A Biobjective Multifacility Minimax Location Problem on a Tree Network," Transportation Science, INFORMS, vol. 16(4), pages 407-429, November.
    7. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    8. Horst Hamacher & Martine Labbé & Stefan Nickel & Anders Skriver, 2002. "Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives," Annals of Operations Research, Springer, vol. 110(1), pages 33-53, February.
    9. Colebrook, Marcos & Sicilia, Joaquin, 2007. "A polynomial algorithm for the multicriteria cent-dian location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1008-1024, June.
    10. Michael P. Johnson, 2001. "A spatial decision support system prototype for housing mobility program planning," Journal of Geographical Systems, Springer, vol. 3(1), pages 49-67, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bargos, Fabiano Fernandes & Lamas, Wendell de Queiroz & Bargos, Danubia Caporusso & Neto, Morun Bernardino & Pardal, Paula Cristiane Pinto Mesquita, 2016. "Location problem method applied to sugar and ethanol mills location optimization," Renewable and Sustainable Energy Reviews, Elsevier, vol. 65(C), pages 274-282.
    2. Blanco, Víctor & Puerto, Justo & Ben-Ali, Safae El-Haj, 2016. "Continuous multifacility ordered median location problems," European Journal of Operational Research, Elsevier, vol. 250(1), pages 56-64.
    3. Nicolas Fröhlich & Stefan Ruzika, 2022. "Interdicting facilities in tree networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 95-118, April.
    4. Nickel, Stefan & Velten, Sebastian, 2017. "Optimization problems with flexible objectives: A general modeling approach and applications," European Journal of Operational Research, Elsevier, vol. 258(1), pages 79-88.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "A bi-objective approach to discrete cost-bottleneck location problems," Annals of Operations Research, Springer, vol. 267(1), pages 179-201, August.
    2. Li, Hongmei & Luo, Taibo & Xu, Yinfeng & Xu, Jiuping, 2018. "Minimax regret vertex centdian location problem in general dynamic networks," Omega, Elsevier, vol. 75(C), pages 87-96.
    3. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    4. Averbakh, Igor & Berman, Oded, 1996. "Locating flow-capturing units on a network with multi-counting and diminishing returns to scale," European Journal of Operational Research, Elsevier, vol. 91(3), pages 495-506, June.
    5. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    6. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    7. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    9. Jones, Dylan & Firouzy, Sina & Labib, Ashraf & Argyriou, Athanasios V., 2022. "Multiple criteria model for allocating new medical robotic devices to treatment centres," European Journal of Operational Research, Elsevier, vol. 297(2), pages 652-664.
    10. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    11. Faustino, Fausta J. & Lopes, José Calixto & Melo, Joel D. & Sousa, Thales & Padilha-Feltrin, Antonio & Brito, José A.S. & Garcia, Claudio O., 2023. "Identifying charging zones to allocate public charging stations for electric vehicles," Energy, Elsevier, vol. 283(C).
    12. Canos, M. J. & Ivorra, C. & Liern, V., 1999. "An exact algorithm for the fuzzy p-median problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 80-86, July.
    13. Hakimi, S.Louis, 1983. "Network location theory and contingency planning," Energy, Elsevier, vol. 8(8), pages 697-702.
    14. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    15. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    16. Kenneth Carling & Xiangli Meng, 2016. "On statistical bounds of heuristic solutions to location problems," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1518-1549, May.
    17. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Sankaran, Jayaram K., 2007. "On solving large instances of the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 178(3), pages 663-676, May.
    19. Jing Yao & Alan T. Murray, 2014. "Locational Effectiveness of Clinics Providing Sexual and Reproductive Health Services to Women in Rural Mozambique," International Regional Science Review, , vol. 37(2), pages 172-193, April.
    20. Kenneth Carling & Xiangli Meng, 2015. "Confidence in heuristic solutions?," Journal of Global Optimization, Springer, vol. 63(2), pages 381-399, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:235:y:2014:i:3:p:484-493. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.