Advanced Search
MyIDEAS: Login

Optimal algorithms for the α-neighbor p-center problem

Contents:

Author Info

  • Chen, Doron
  • Chen, Reuven
Registered author(s):

    Abstract

    Assigning multiple service facilities to demand points is important when demand points are required to withstand service facility failures. Such failures may result from a multitude of causes, ranging from technical difficulties to natural disasters. The α-neighbor p-center problem deals with locating p service facilities. Each demand point is assigned to its nearest α service facilities, thus it is able to withstand up to α−1 service facility failures. The objective is to minimize the maximum distance between a demand point and its αth nearest service facility. We present two optimal algorithms for both the continuous and discrete α-neighbor p-center problem. We present experimental results comparing the performance of the two optimal algorithms for α=2. We also present experimental results showing the performance of the relaxation algorithm for α=1, 2, 3.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712007205
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 225 (2013)
    Issue (Month): 1 ()
    Pages: 36-43

    as in new window
    Handle: RePEc:eee:ejores:v:225:y:2013:i:1:p:36-43

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords: α-Neighbor p-center; Continuous optimization; Discrete optimization; Relaxation;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Kathleen Hogan & Charles ReVelle, 1986. "Concepts and Applications of Backup Coverage," Management Science, INFORMS, vol. 32(11), pages 1434-1444, November.
    2. Eiselt, H.A. & Marianov, Vladimir, 2012. "Mobile phone tower location for survival after natural disasters," European Journal of Operational Research, Elsevier, vol. 216(3), pages 563-572.
    3. Marianov, Vladimir & ReVelle, Charles, 1996. "The Queueing Maximal availability location problem: A model for the siting of emergency vehicles," European Journal of Operational Research, Elsevier, vol. 93(1), pages 110-120, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:225:y:2013:i:1:p:36-43. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.