IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i11p2002-2012.html
   My bibliography  Save this article

Discrete cooperative covering problems

Author

Listed:
  • O Berman

    (University of Toronto, Toronto, Canada)

  • Z Drezner

    (California State University-Fullerton, Fullerton, USA)

  • D Krass

    (University of Toronto, Toronto, Canada)

Abstract

A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two other problems that can be solved by the max-cover approach are the equivalents to set covering and p-centre problems. The problems are formulated, analysed and solved on networks. Optimal and heuristic algorithms are proposed and extensive computational experiments reported.

Suggested Citation

  • O Berman & Z Drezner & D Krass, 2011. "Discrete cooperative covering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 2002-2012, November.
    • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:11:p:2002-2012
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v62/n11/pdf/jors2010176a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v62/n11/full/jors2010176a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Bababeik, Mostafa & Khademi, Navid & Chen, Anthony, 2018. "Increasing the resilience level of a vulnerable rail network: The strategy of location and allocation of emergency relief trains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 110-128.
    2. Aghajani, Mojtaba & Torabi, S. Ali & Heydari, Jafar, 2020. "A novel option contract integrated with supplier selection and inventory prepositioning for humanitarian relief supply chains," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    3. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    4. Xianjun Guan & Fei Bi & Min Liu & Huayou Chen & Ligang Zhou, 2018. "Study on location allocation of earthquake emergency service depot based on hybrid multi-attribute decision making," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 90(1), pages 337-348, January.
    5. 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.
    6. Brachner, Markus & Hvattum, Lars Magnus, 2017. "Combined emergency preparedness and operations for safe personnel transport to offshore locations," Omega, Elsevier, vol. 67(C), pages 31-41.
    7. Blanco, Víctor & Gázquez, Ricardo & Saldanha-da-Gama, Francisco, 2023. "Multi-type maximal covering location problems: Hybridizing discrete and continuous problems," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1040-1054.
    8. Karatas, Mumtaz & Eriskin, Levent, 2023. "Linear and piecewise linear formulations for a hierarchical facility location and sizing problem," Omega, Elsevier, vol. 118(C).
    9. Emilio Carrizosa, 2015. "Comments on: Static and dynamic source locations in undirected networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(3), pages 647-649, October.
    10. 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.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:62:y:2011:i:11:p:2002-2012. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.palgrave-journals.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.