IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v42y1995i8p1141-1160.html
   My bibliography  Save this article

Facility location and capacity acquisition: An integrated approach

Author

Listed:
  • Vedat Verter
  • M. Cemal Dincer

Abstract

The facility location and capacity acquisition decisions are intertwined, especially within the international context where capacity acquisition costs are location dependent. A review of the relevant literature however, reveals that the facility location and the capacity acquisition problems have been dealt with separately. Thus, an integrated approach for simultaneous optimization of these strategic decisions is presented. Analytical properties of the arising model are investigated and an algorithm for solving the problem is devised. Encouraging computational results are reported. © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • Vedat Verter & M. Cemal Dincer, 1995. "Facility location and capacity acquisition: An integrated approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1141-1160, December.
    • Handle: RePEc:wly:navres:v:42:y:1995:i:8:p:1141-1160
    DOI: 10.1002/1520-6750(199512)42:83.0.CO;2-B
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199512)42:83.0.CO;2-B
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199512)42:83.0.CO;2-B?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
    ---><---

    References listed on IDEAS

    as
    1. Alfred A. Kuehn & Michael J. Hamburger, 1963. "A Heuristic Program for Locating Warehouses," Management Science, INFORMS, vol. 9(4), pages 643-666, July.
    2. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    3. Verter, Vedat & Cemal Dincer, M., 1992. "An integrated evaluation of facility location, capacity acquisition, and technology selection for designing global manufacturing strategies," European Journal of Operational Research, Elsevier, vol. 60(1), pages 1-18, July.
    4. James E. Falk & Richard M. Soland, 1969. "An Algorithm for Separable Nonconvex Programming Problems," Management Science, INFORMS, vol. 15(9), pages 550-569, May.
    5. Hanan Luss, 1982. "Operations Research and Capacity Expansion Problems: A Survey," Operations Research, INFORMS, vol. 30(5), pages 907-947, October.
    6. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    7. Richard M. Soland, 1974. "Optimal Facility Location with Concave Costs," Operations Research, INFORMS, vol. 22(2), pages 373-382, April.
    8. Beasley, J. E., 1988. "An algorithm for solving large capacitated warehouse location problems," European Journal of Operational Research, Elsevier, vol. 33(3), pages 314-325, February.
    9. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    10. M. Florian & P. Robillard, 1971. "An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem," Management Science, INFORMS, vol. 18(3), pages 184-193, November.
    11. Krarup, Jakob & Pruzan, Peter Mark, 1983. "The simple plant location problem: Survey and synthesis," European Journal of Operational Research, Elsevier, vol. 12(1), pages 36-57, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Li, Lei & Manier, Hervé & Manier, Marie-Ange, 2019. "Hydrogen supply chain network design: An optimization-oriented review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 103(C), pages 342-360.
    2. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Verter, Vedat & Dasci, Abdullah, 2002. "The plant location and flexible technology acquisition problem," European Journal of Operational Research, Elsevier, vol. 136(2), pages 366-382, January.
    2. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    3. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    4. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    6. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    7. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    8. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    9. Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.
    10. Rajagopalan, S. & Yu, Hung-Liang, 2001. "Capacity planning with congestion effects," European Journal of Operational Research, Elsevier, vol. 134(2), pages 365-377, October.
    11. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    12. Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
    13. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    14. Myung, Young-Soo & Kim, Hu-gon & Tcha, Dong-wan, 1997. "A bi-objective uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 608-616, August.
    15. Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    16. Wooseung Jang & J. George Shanthikumar, 2002. "Stochastic allocation of inspection capacity to competitive processes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 78-94, February.
    17. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    18. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    19. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    20. Francisco Casas & Claudio E. Torres & Ignacio Araya, 2022. "A heuristic search based on diversity for solving combinatorial problems," Journal of Heuristics, Springer, vol. 28(3), pages 287-328, June.

    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:wly:navres:v:42:y:1995:i:8:p:1141-1160. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.