IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v18y1984i4p315-330.html
   My bibliography  Save this article

Location-Relocation of Mobile Facilities on a Stochastic Network

Author

Listed:
  • O. Berman

    (The University of Calgary, Calgary, Alberta, Canada)

  • B. LeBlanc

    (The University of Calgary, Calgary, Alberta, Canada)

Abstract

In this paper we deal with networks whose link travel times are not constant but undergo random changes. As a result of these changes the network may be in a finite number of discrete states. The paper contains a heuristic that finds the optimal set of locations for a set a facilities (servers), which may be moved, at a cost, in response to changes in the state of the network. The heuristic is suitable for a general number of facilities (previous research dealt with a single facility). The heuristic, which executes in polynomial time, is compared to the exact solution of the integer linear programming version of the problem for a series of small examples. For larger examples, the solution of the heuristic is compared to several bounds. An efficient method for performing sensitivity analysis is also indicated.

Suggested Citation

  • O. Berman & B. LeBlanc, 1984. "Location-Relocation of Mobile Facilities on a Stochastic Network," Transportation Science, INFORMS, vol. 18(4), pages 315-330, November.
    • Handle: RePEc:inm:ortrsc:v:18:y:1984:i:4:p:315-330
    DOI: 10.1287/trsc.18.4.315
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.18.4.315
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.18.4.315?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
    ---><---

    Citations

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


    Cited by:

    1. Reza Farahani & Zvi Drezner & Nasrin Asgari, 2009. "Single facility location and relocation problem with time dependent weights and discrete planning horizon," Annals of Operations Research, Springer, vol. 167(1), pages 353-368, March.
    2. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    3. Fang Lu & John J. Hasenbein & David P. Morton, 2016. "Modeling and Optimization of a Spatial Detection System," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 512-526, August.
    4. Wenxuan Shan & Qianqian Yan & Chao Chen & Mengjie Zhang & Baozhen Yao & Xuemei Fu, 2019. "Optimization of competitive facility location for chain stores," Annals of Operations Research, Springer, vol. 273(1), pages 187-205, February.
    5. Current, John & Ratick, Samuel & ReVelle, Charles, 1998. "Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach," European Journal of Operational Research, Elsevier, vol. 110(3), pages 597-609, November.

    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:inm:ortrsc:v:18:y:1984:i:4:p:315-330. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.