IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i2d10.1007_s10878-023-00997-9.html
   My bibliography  Save this article

The balanced 2-median and 2-maxian problems on a tree

Author

Listed:
  • Jafar Fathali

    (Shahrood University of Technology, University Blvd.)

  • Mehdi Zaferanieh

    (Hakim Sabzevari University)

Abstract

This paper deals with the facility location problems on a balancing allocation approach. Two location models are proposed, which are convex combinations of the traditional p-median and p-maxian problems together with minimizing the maximum demand level allocated to any facility. An edge deletion method with time complexity $$O(n^2)$$ O ( n 2 ) is represented for the balanced 2-median problem on a tree. For the balanced 2-maxian problem, it is shown the optimal solution is two end vertices of the longest path of the tree, which can be obtained in linear time.

Suggested Citation

  • Jafar Fathali & Mehdi Zaferanieh, 2023. "The balanced 2-median and 2-maxian problems on a tree," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-16, March.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00997-9
    DOI: 10.1007/s10878-023-00997-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-00997-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-023-00997-9?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. Trung Kien Nguyen & Nguyen Thanh Hung & Huong Nguyen-Thu, 2020. "A linear time algorithm for the p-maxian problem on trees with distance constraint," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1030-1043, November.
    2. 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.
    3. Marín, Alfredo, 2011. "The discrete facility location problem with balanced allocation of customers," European Journal of Operational Research, Elsevier, vol. 210(1), pages 27-38, April.
    4. Marsh, Michael T. & Schilling, David A., 1994. "Equity measurement in facility location analysis: A review and framework," European Journal of Operational Research, Elsevier, vol. 74(1), pages 1-17, April.
    5. 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.
    6. Oded Berman & Zvi Drezner & Arie Tamir & George Wesolowsky, 2009. "Optimal location with equitable loads," Annals of Operations Research, Springer, vol. 167(1), pages 307-325, March.
    7. G. Y. Handler, 1973. "Minimax Location of a Facility in an Undirected Tree Graph," Transportation Science, INFORMS, vol. 7(3), pages 287-293, August.
    8. Mark S. Daskin & Emily L. Tucker, 2018. "The trade-off between the median and range of assigned demand in facility location models," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 97-119, January.
    Full references (including those not matched with items on IDEAS)

    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. Jesús Sánchez-Oro & Ana D. López-Sánchez & Anna Martínez-Gavara & Alfredo G. Hernández-Díaz & Abraham Duarte, 2021. "A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k -Balanced Center Location Problem," Mathematics, MDPI, vol. 9(8), pages 1-21, April.
    2. 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.
    3. Shahede Omidi & Jafar Fathali & Morteza Nazari, 2020. "Inverse and reverse balanced facility location problems with variable edge lengths on trees," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 261-273, June.
    4. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    5. Xu, Jing & Murray, Alan T. & Church, Richard L. & Wei, Ran, 2023. "Service allocation equity in location coverage analytics," European Journal of Operational Research, Elsevier, vol. 305(1), pages 21-37.
    6. James H. Lambert & Mark W. Farrington, 2006. "Risk‐Based Objectives for the Allocation of Chemical, Biological, and Radiological Air Emissions Sensors," Risk Analysis, John Wiley & Sons, vol. 26(6), pages 1659-1674, December.
    7. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    8. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    9. 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.
    10. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    11. Wen, Meilin & Iwamura, Kakuzo, 2008. "Fuzzy facility location-allocation problem under the Hurwicz criterion," European Journal of Operational Research, Elsevier, vol. 184(2), pages 627-635, January.
    12. Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.
    13. Xin Feng & Alan T. Murray, 2018. "Allocation using a heterogeneous space Voronoi diagram," Journal of Geographical Systems, Springer, vol. 20(3), pages 207-226, July.
    14. Wei Ding & Ke Qiu, 2020. "Approximating the asymmetric p-center problem in parameterized complete digraphs," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 21-35, July.
    15. 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.
    16. Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    17. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.
    18. 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.
    19. Milosav Georgijevic & Sanja Bojic & Dejan Brcanov, 2013. "The location of public logistic centers: an expanded capacity-limited fixed cost location-allocation modeling approach," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(2), pages 218-229, April.
    20. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.

    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:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00997-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.