IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v40y2023i03ns0217595922500452.html
   My bibliography  Save this article

Location Problems with Cutoff

Author

Listed:
  • Raoul Müller

    (Institute for Mathematical Stochastics, University of Göttingen, 37077 Göttingen, Germany)

  • Anita Schöbel

    (Faculty for Mathematics, Technische Universität Kaiserslautern and Fraunhofer, Institute for Industrial Mathematics (ITWM), 67663 Kaiserslautern, Germany)

  • Dominic Schuhmacher

    (Institute for Mathematical Stochastics, University of Göttingen, 37077 Göttingen, Germany)

Abstract

In this paper, we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting, these distances may be cut off at a given value C > 0, and we allow for the option of an empty solution at a fixed cost C′. We analyze under which circumstances these problems can be reduced to the simpler Weber problem, and also when we definitely have to solve the more complex problem with cutoff.We furthermore present adaptions of the algorithm of Drezner, Mehrez and Wesolowsky (1991 [The facility location problem with limited distances. Transportation Science, 25(3), 183–187, INFORMS]) to our setting, which in certain situations are able to substantially reduce computation times as demonstrated in a simulation study. The sensitivity with respect to the cutoff value is also studied, which allows us to provide an algorithm that efficiently solves the problem simultaneously for all C > 0.

Suggested Citation

  • Raoul Müller & Anita Schöbel & Dominic Schuhmacher, 2023. "Location Problems with Cutoff," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(03), pages 1-33, June.
    • Handle: RePEc:wsi:apjorx:v:40:y:2023:i:03:n:s0217595922500452
    DOI: 10.1142/S0217595922500452
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595922500452
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595922500452?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.

    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:wsi:apjorx:v:40:y:2023:i:03:n:s0217595922500452. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.