IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i10p1091-1105.html
   My bibliography  Save this article

A Dual-Based Procedure for Dynamic Facility Location

Author

Listed:
  • Tony J. Van Roy

    (Université Catholique de Louvain, Belgium)

  • Donald Erlenkotter

    (University of California, Los Angeles and the International Institute for Applied Systems Analysis)

Abstract

In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total discounted costs for meeting demands specified over time at various customer locations. We formulate a particular dynamic facility location problem as a combinatorial optimization problem. The formulation permits both the opening of new facilities and the closing of existing ones. A branch-and-bound procedure incorporating a dual ascent method is presented and shown, in computational tests, to be superior to previously developed methods. The procedure is comparable to the most efficient methods for solving static (single-period) location problems. Problems with 25 potential facility locations, 50 customer locations, and 10 time periods have been solved within one second of CPU time on an IBM 3033 computer. Extensions of the dynamic facility location problem that allow price-sensitive demands, linearized concave costs, interdependent projects, multiple stages, and multiple commodities also can be solved by the dual ascent method. The method can serve as a component of a solution process for capacitated dynamic location problems.

Suggested Citation

  • Tony J. Van Roy & Donald Erlenkotter, 1982. "A Dual-Based Procedure for Dynamic Facility Location," Management Science, INFORMS, vol. 28(10), pages 1091-1105, October.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:10:p:1091-1105
    DOI: 10.1287/mnsc.28.10.1091
    as

    Download full text from publisher

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

    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:ormnsc:v:28:y:1982:i:10:p:1091-1105. 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.