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

The minmax regret gradual covering location problem on a network with incomplete information of demand weights

Author

Listed:
  • Berman, Oded
  • Wang, Jiamin

Abstract

The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered, allowing partial coverage. We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown. Using only information on the range of these random variables, this study is aimed at finding the "minmax regret" location that minimizes the worst-case coverage loss. We show that under some conditions, the problem is equivalent to known location problems (e.g. the minmax regret median problem). Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions.

Suggested Citation

  • Berman, Oded & Wang, Jiamin, 2011. "The minmax regret gradual covering location problem on a network with incomplete information of demand weights," European Journal of Operational Research, Elsevier, vol. 208(3), pages 233-238, February.
    • Handle: RePEc:eee:ejores:v:208:y:2011:i:3:p:233-238
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00553-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    2. Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
    3. Saaty, Thomas L. & Vargas, Luis G., 1987. "Uncertainty and rank order in the analytic hierarchy process," European Journal of Operational Research, Elsevier, vol. 32(1), pages 107-117, October.
    4. O Berman & J Wang, 2008. "The probabilistic 1-maximal covering problem on a network with discrete demand weights," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1398-1405, October.
    5. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, 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. Vatsa, Amit Kumar & Jayaswal, Sachin, 2016. "A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 251(2), pages 404-418.
    2. Vahid Hajipour & Parviz Fattahi & Hasan Bagheri & Samaneh Babaei Morad, 2022. "Dynamic maximal covering location problem for fire stations under uncertainty: soft-computing approaches," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(1), pages 90-112, February.
    3. Karatas, Mumtaz & Eriskin, Levent, 2021. "The minimal covering location and sizing problem in the presence of gradual cooperative coverage," European Journal of Operational Research, Elsevier, vol. 295(3), pages 838-856.
    4. Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
    5. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    6. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    7. Vatsa, Amit Kumar, 2014. "Multi-Period Facility Location Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. Blanco, Víctor & Martínez-Antón, Miguel, 2024. "Optimal coverage-based placement of static leak detection devices for pipeline water supply networks," Omega, Elsevier, vol. 122(C).
    9. Vatsa, Amit Kumar & Jayaswal, Sachin, 2021. "Capacitated multi-period maximal covering location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1107-1126.
    10. Baldomero-Naranjo, Marta & Kalcsics, Jörg & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2022. "Upgrading edges in the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 14-36.
    11. Vatsa, Amit Kumar & Ghosh, Diptesh, 2014. "Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-11-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. David Kik & Matthias G. Wichmann & Thomas S. Spengler, 2023. "Small- or Medium-Sized Enterprise Uses Operations Research to Select and Develop its Headquarters Location," Interfaces, INFORMS, vol. 53(4), pages 312-331, July.
    13. Bashiri, Mahdi & Chehrepak, Elaheh & Gomari, Saeed, 2014. "Gradual Covering Location Problem with Stochastic Radius," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Blecker, Thorsten & Kersten, Wolfgang & Ringle, Christian M. (ed.), Innovative Methods in Logistics and Supply Chain Management: Current Issues and Emerging Practices. Proceedings of the Hamburg International Conferenc, volume 19, pages 165-186, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.

    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. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.
    3. Conde, Eduardo, 2007. "Minmax regret location-allocation problem on a network under uncertainty," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1025-1039, June.
    4. Wang, Haitao, 2014. "Minmax regret 1-facility location on uncertain path networks," European Journal of Operational Research, Elsevier, vol. 239(3), pages 636-643.
    5. Vatsa, Amit Kumar & Jayaswal, Sachin, 2016. "A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 251(2), pages 404-418.
    6. Juan Yu & Mi Gan & Shaoquan Ni & Dingjun Chen, 2018. "Multi-objective models and real case study for dual-channel FAP supply chain network design with fuzzy information," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 389-403, February.
    7. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2023. "Robust maximum capture facility location under random utility maximization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1128-1150.
    8. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    9. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    10. Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
    11. Mikhailov, L., 2004. "A fuzzy approach to deriving priorities from interval pairwise comparison judgements," European Journal of Operational Research, Elsevier, vol. 159(3), pages 687-704, December.
    12. Wang, Ying-Ming & Elhag, Taha M.S., 2007. "A goal programming method for obtaining interval weights from an interval comparison matrix," European Journal of Operational Research, Elsevier, vol. 177(1), pages 458-471, February.
    13. Ji-Hee Lee & Woo-Young Chun & Jun-Ho Choi, 2021. "Weighting the Attributes of Human-Related Activities for Fire Safety Measures in Historic Villages," Sustainability, MDPI, vol. 13(6), pages 1-12, March.
    14. Zeshui Xu, 2013. "Compatibility Analysis of Intuitionistic Fuzzy Preference Relations in Group Decision Making," Group Decision and Negotiation, Springer, vol. 22(3), pages 463-482, May.
    15. Levary, Reuven R. & Wan, Ke, 1999. "An analytic hierarchy process based simulation model for entry mode decision regarding foreign direct investment," Omega, Elsevier, vol. 27(6), pages 661-677, December.
    16. Stefanos Dosis & George P. Petropoulos & Kleomenis Kalogeropoulos, 2023. "A Geospatial Approach to Identify and Evaluate Ecological Restoration Sites in Post-Fire Landscapes," Land, MDPI, vol. 12(12), pages 1-23, December.
    17. Zhu, Bin & Xu, Zeshui, 2014. "Stochastic preference analysis in numerical preference relations," European Journal of Operational Research, Elsevier, vol. 237(2), pages 628-633.
    18. Arana-Jiménez, Manuel & Blanco, Víctor & Fernández, Elena, 2020. "On the fuzzy maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 283(2), pages 692-705.
    19. Erhan Erkut & Armann Ingolfsson & Güneş Erdoğan, 2008. "Ambulance location for maximum survival," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 42-58, February.
    20. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, 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:eee:ejores:v:208:y:2011:i:3:p:233-238. 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.