IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v123y2003i1p173-18810.1023-a1026127430341.html
   My bibliography  Save this article

Efficient Location for a Semi-Obnoxious Facility

Author

Listed:
  • Yoshiaki Ohsawa
  • Kazuki Tamura

Abstract

This paper deals with a location model for the placement of a semi-obnoxious facility in a continuous plane with the twin objectives of maximizing the distance to the nearest inhabitant and minimizing the sum of distances to all the users (or the distance to the farthest user) in a unified manner. For special cases, this formulation includes (1) elliptic maximin and rectangular minisum criteria problem, and (2) rectangular maximin and minimax criteria problem. Polynomial-time algorithms for finding the efficient set and the tradeoff curve are presented. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Yoshiaki Ohsawa & Kazuki Tamura, 2003. "Efficient Location for a Semi-Obnoxious Facility," Annals of Operations Research, Springer, vol. 123(1), pages 173-188, October.
    • Handle: RePEc:spr:annopr:v:123:y:2003:i:1:p:173-188:10.1023/a:1026127430341
    DOI: 10.1023/A:1026127430341
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1026127430341
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1026127430341?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. Heydari, Ruhollah & Melachrinoudis, Emanuel, 2012. "Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives," European Journal of Operational Research, Elsevier, vol. 223(2), pages 452-460.
    2. A. Jourani & C. Michelot & M. Ndiaye, 2009. "Efficiency for continuous facility location problems with attraction and repulsion," Annals of Operations Research, Springer, vol. 167(1), pages 43-60, March.
    3. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    4. 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.
    5. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    6. Abravaya, Shimon & Segal, Michael, 2009. "Low complexity algorithms for optimal consumer push-pull partial covering in the plane," European Journal of Operational Research, Elsevier, vol. 197(2), pages 456-464, September.
    7. Yoshiaki Ohsawa & Naoya Ozaki & Frank Plastria, 2008. "Equity-Efficiency Bicriteria Location with Squared Euclidean Distances," Operations Research, INFORMS, vol. 56(1), pages 79-87, February.

    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:annopr:v:123:y:2003:i:1:p:173-188:10.1023/a:1026127430341. 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.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.