IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i3p598-607.html
   My bibliography  Save this article

Multiple obnoxious facilities with weighted demand points

Author

Listed:
  • Pawel Kalczynski
  • Atsuo Suzuki
  • Zvi Drezner

Abstract

In this paper we define and heuristically solve the multiple weighted obnoxious facilities location problem maximizing the minimum weighted distance between facilities and a given set of communities. Each community may have a different weight because different communities may be affected differently by a facility. The distance between pairs of facilities must exceed a given minimum distance. Solving the problem by the multi-purpose non-linear solver SNOPT from random starting locations performed poorly. Three approaches are proposed to generate “good” starting solutions. The best known solutions were established by these approaches.

Suggested Citation

  • Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2022. "Multiple obnoxious facilities with weighted demand points," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(3), pages 598-607, March.
    • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:3:p:598-607
    DOI: 10.1080/01605682.2020.1851149
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1851149
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1851149?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.

    Citations

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


    Cited by:

    1. Tammy Drezner & Morton O’Kelly & Zvi Drezner, 2023. "Multipurpose shopping trips and location," Annals of Operations Research, Springer, vol. 321(1), pages 191-208, February.
    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. Zvi Drezner & Dawit Zerom, 2023. "Competitive facility location under attrition," Computational Management Science, Springer, vol. 20(1), pages 1-19, December.
    4. Richard L. Church & Zvi Drezner & Pawel Kalczynski, 2023. "Extensions to the planar p-median problem," Annals of Operations Research, Springer, vol. 326(1), pages 115-135, July.

    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:taf:tjorxx:v:73:y:2022:i:3:p:598-607. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.