IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i3p423-436.html
   My bibliography  Save this article

An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes

Author

Listed:
  • Alexander Shulman

    (GTE Laboratories, Incorporated, Waltham, Massachusetts)

Abstract

In the Dynamic Capacitated Plant Location Problem (DCPLP) the task is to find a time schedule and sizes for installing facilities at plant locations to minimize the discounted cost of capital expenditures over the planning horizon. The costs include setup costs for establishing facilities, volume dependent operational costs, and transportation costs for distributing demand from facilities to customers. We consider a class of the DCPLP in which the available facilities have finite capacities and the number of facility types is relatively small so that the expansion sizes cannot be modeled by continuous variables. The DCPLP is formulated as a combinatorial optimization problem that allows consideration of more than one fatality type and finds the optimum mix of facilities in each location. We describe an optimization algorithm for solving the DCPLP based on the Lagrangian relaxation technique. Algorithms for converting infeasible optimal solutions of the Lagrangian to a feasible solution of the DCPLP are presented. The procedure has been tested on both randomly generated and real-life based problems. Computational results indicate that the algorithm produces solutions within 3% of the lower bounds for a wide range of input data.

Suggested Citation

  • Alexander Shulman, 1991. "An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes," Operations Research, INFORMS, vol. 39(3), pages 423-436, June.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:3:p:423-436
    DOI: 10.1287/opre.39.3.423
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.3.423
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.3.423?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:oropre:v:39:y:1991:i:3:p:423-436. 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.