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

The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic

Author

Listed:
  • C. O. Fong

    (Faculty of Economics and Administration, University of Malaya, Kuala Lumpur 22-11, Malaysia)

  • V. Srinivasan

    (Graduate School of Business, Stanford University, Stanford, California 94305)

Abstract

We consider the problem of determining a schedule of capacity expansions for m producing regions and a schedule of shipments from the regions to n markets so as to meet market demands over a T-period planning horizon at minimum discounted capacity expansion and shipment costs. The proposed algorithm permits capacity expansion costs to be arbitrary nonnegative increasing functions of the expansion amounts, but the shipment (and production) costs are restricted to be proportional to the amounts shipped. The algorithm does not require market demands to be increasing over time. The cost functions are allowed to be nonstationary and the possibility of imports is considered. The proposed heuristic algorithm improves on feasible solutions by simultaneously reassigning several capacity expansions to different regions and/or time periods. A look-ahead feature prevents the algorithm from becoming myopic and a self-learning feature dynamically updates computational parameters. The heuristic algorithm was tested on both randomly generated and real-life based problems with m \le 15, and n \le 15 and T \le 25. The test problems had increasing market demands, capacity expansion costs specified in the form of a concave power function or a fixed charge plus linear function, stationary costs (aside from a constant discount factor), and no imports. Results indicate that for the class of problems tested, the heuristic algorithm is computationally efficient and provides solutions that are closer to optimum than those obtained by previous algorithms.

Suggested Citation

  • C. O. Fong & V. Srinivasan, 1986. "The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic," Management Science, INFORMS, vol. 32(9), pages 1140-1152, September.
  • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:9:p:1140-1152
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.9.1140
    Download Restriction: no

    Citations

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


    Cited by:

    1. Martínez-Costa, Carme & Mas-Machuca, Marta & Benedito, Ernest & Corominas, Albert, 2014. "A review of mathematical programming models for strategic capacity planning in manufacturing," International Journal of Production Economics, Elsevier, vol. 153(C), pages 66-85.
    2. Francisco André & Francisco Velasco & Luis Gonzalez-Abril, 2009. "Intertemporal and spatial location of disposal facilities," Spanish Economic Review, Springer;Spanish Economic Association, vol. 11(1), pages 23-49, March.
    3. Maria Albareda-Sambola & Antonio Alonso-Ayuso & Laureano Escudero & Elena Fernández & Yolanda Hinojosa & Celeste Pizarro-Romero, 2010. "A computational comparison of several formulations for the multi-period incremental service facility location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 62-80, July.
    4. repec:pal:jorsoc:v:56:y:2005:i:4:d:10.1057_palgrave.jors.2601826 is not listed on IDEAS
    5. Mørch, Ove & Fagerholt, Kjetil & Pantuso, Giovanni & Rakke, Jørgen, 2017. "Maximizing the rate of return on the capital employed in shipping capacity renewal," Omega, Elsevier, vol. 67(C), pages 42-53.
    6. Seifert, Ralf W. & Langenberg, Kerstin U., 2011. "Managing business dynamics with adaptive supply chain portfolios," European Journal of Operational Research, Elsevier, vol. 215(3), pages 551-562, December.

    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:32:y:1986:i:9:p:1140-1152. 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: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.