IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v4y2000i1d10.1023_a1009802105661.html
   My bibliography  Save this article

Facility Dispersion Problems Under Capacity and Cost Constraints

Author

Listed:
  • Daniel J. Rosenkrantz

    (University at Albany—State University of New York)

  • Giri K. Tayi

    (University at Albany—State University of New York)

  • S.S. Ravi

    (University at Albany—State University of New York)

Abstract

The MAX-MIN dispersion problem, which arises in the placement of undesirable facilities, involves selecting a specified number of sites among a set of potential sites so as to maximize the minimum distance between any pair of selected sites. We consider different versions of this dispersion problem where each potential site has an associated storage capacity and a storage cost. A typical problem in this context is to choose a subset of potential sites so that the total capacity of the chosen sites is at least a given value, the total storage cost is within the specified budget and the minimum distance between any pair of chosen sites is maximized. Since these constrained optimization problems are NP-hard in general, we consider whether there are efficient approximation algorithms for them with good performance guarantees. Our results include approximation algorithms for some versions, approximation schemes for some geometric versions and polynomial algorithms for special cases. We also present results that bring out the intrinsic difficulty of obtaining near-optimal solutions to some versions.

Suggested Citation

  • Daniel J. Rosenkrantz & Giri K. Tayi & S.S. Ravi, 2000. "Facility Dispersion Problems Under Capacity and Cost Constraints," Journal of Combinatorial Optimization, Springer, vol. 4(1), pages 7-33, March.
    • Handle: RePEc:spr:jcomop:v:4:y:2000:i:1:d:10.1023_a:1009802105661
    DOI: 10.1023/A:1009802105661
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009802105661
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009802105661?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. R. Chandrasekaran & A. Daughety, 1981. "Location on Tree Networks: P -Centre and n -Dispersion Problems," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 50-57, February.
    2. Erkut, E. & ReVelle, C. & Ulkusal, Y., 1996. "Integer-friendly formulations for the r-separation problem," European Journal of Operational Research, Elsevier, vol. 92(2), pages 342-351, July.
    3. Erkut, Erhan & Neuman, Susan, 1989. "Analytical models for locating undesirable facilities," European Journal of Operational Research, Elsevier, vol. 40(3), pages 275-291, June.
    4. I. Douglas Moon & Sohail S. Chaudhry, 1984. "An Analysis of Network Location Problems with Distance Constraints," Management Science, INFORMS, vol. 30(3), pages 290-307, March.
    5. Melachrinoudis, Emanuel & Cullinane, Thomas P., 1986. "Locating an undesirable facility with a minimax criterion," European Journal of Operational Research, Elsevier, vol. 24(2), pages 239-246, February.
    6. Richard L. Church & Robert S. Garfinkel, 1978. "Locating an Obnoxious Facility on a Network," Transportation Science, INFORMS, vol. 12(2), pages 107-118, May.
    7. S. S. Ravi & D. J. Rosenkrantz & G. K. Tayi, 1994. "Heuristic and Special Case Algorithms for Dispersion Problems," Operations Research, INFORMS, vol. 42(2), pages 299-310, April.
    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. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    2. Juan F. Gomez & Javier Panadero & Rafael D. Tordecilla & Juliana Castaneda & Angel A. Juan, 2022. "A Multi-Start Biased-Randomized Algorithm for the Capacitated Dispersion Problem," Mathematics, MDPI, vol. 10(14), pages 1-20, July.
    3. Jia Wang & Shiyan Hu, 2013. "A linear time approximation scheme for computing geometric maximum k-star," Journal of Global Optimization, Springer, vol. 55(4), pages 849-855, April.

    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. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    2. Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    3. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.
    4. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
    5. Welch, S. B. & Salhi, S., 1997. "The obnoxious p facility network location problem with facility interaction," European Journal of Operational Research, Elsevier, vol. 102(2), pages 302-319, October.
    6. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    7. Batta, Rajan & Lejeune, Miguel & Prasad, Srinivas, 2014. "Public facility location using dispersion, population, and equity criteria," European Journal of Operational Research, Elsevier, vol. 234(3), pages 819-829.
    8. Niblett, Matthew R. & Church, Richard L., 2015. "The disruptive anti-covering location problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 764-773.
    9. Sayyady, Fatemeh & Fathi, Yahya, 2016. "An integer programming approach for solving the p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 216-225.
    10. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    11. Samuel Ratick & Brian Meacham & Yuko Aoyama, 2008. "Locating Backup Facilities to Enhance Supply Chain Disaster Resilience," Growth and Change, Wiley Blackwell, vol. 39(4), pages 642-666, December.
    12. Alan T. Murray & Ran Wei & Richard L. Church & Matthew R. Niblett, 2019. "Addressing risks and uncertainty in forest land use modeling," Journal of Geographical Systems, Springer, vol. 21(3), pages 319-338, September.
    13. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
    14. O Berman & Q Wang, 2007. "Locating semi-obnoxious facilities with expropriation: minisum criterion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 378-390, March.
    15. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    16. Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2023. "Obnoxious facility location in multiple dimensional space," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 331-354, July.
    17. Fernandez, J. & Fernandez, P. & Pelegrin, B., 2000. "A continuous location model for siting a non-noxious undesirable facility within a geographical region," European Journal of Operational Research, Elsevier, vol. 121(2), pages 259-274, March.
    18. Berman, Oded & Drezner, Zvi, 2000. "A note on the location of an obnoxious facility on a network," European Journal of Operational Research, Elsevier, vol. 120(1), pages 215-217, January.
    19. Eiselt, H.A. & Marianov, Vladimir, 2014. "A bi-objective model for the location of landfills for municipal solid waste," European Journal of Operational Research, Elsevier, vol. 235(1), pages 187-194.
    20. Plastria, Frank & Carrizosa, Emilio, 1999. "Undesirable facility location with minimal covering objectives," European Journal of Operational Research, Elsevier, vol. 119(1), pages 158-180, November.

    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:4:y:2000:i:1:d:10.1023_a:1009802105661. 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.