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

The Multiperiod Location-Allocation Problem with Relocation of Facilities

Author

Listed:
  • George O. Wesolowsky

    (McMaster University)

  • William G. Truscott

    (McMaster University)

Abstract

A dynamic or multiperiod location-allocation formulation is developed from the static problem of locating G facilities among M possible sites to serve N demand points. This dynamic model provides a tool for analyzing tradeoffs among present values of static distribution costs in each period and costs of relocating facilities. The objective is to specify the plan for facility locations and relocations and for attendant allocations of demands which minimize these costs. Two methods of solution are presented. First, a mixed-integer programming approach is used to solve sample problems. From computational results reported for structurally-similar problems, it seems that efficient general purpose codes for this method would be capable of solving problems with at least 5 periods, 5 potential sites, and 15 demand points. The second method, dynamic programming, is capable of increasing the size of problems that are computationally feasible. The dynamic programming approach is quite attractive when the relative values of G and M restrict the state space to a manageable size and constraints on the extent of location changes in each period limit the number of alternate decisions. Possible extensions of the model and solution procedures are discussed.

Suggested Citation

  • George O. Wesolowsky & William G. Truscott, 1975. "The Multiperiod Location-Allocation Problem with Relocation of Facilities," Management Science, INFORMS, vol. 22(1), pages 57-65, September.
    • Handle: RePEc:inm:ormnsc:v:22:y:1975:i:1:p:57-65
    DOI: 10.1287/mnsc.22.1.57
    as

    Download full text from publisher

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

    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:ormnsc:v:22:y:1975:i:1:p:57-65. 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.