IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i3d10.1057_palgrave.jors.2600698.html
   My bibliography  Save this article

Efficient solution of large scale, single-source, capacitated plant location problems

Author

Listed:
  • K S Hindi

    (Brunel University)

  • K Pieńkosz

    (Warsaw University of Technology)

Abstract

The single-source, capacitated plant location problem is considered. This problem differs from the capacitated plant location problem by the additional requirement that each customer must be supplied with all its demand from a single plant. An efficient heuristic solution, capable of solving large problem instances, is presented. The heuristic combines Lagrangian relaxation with restricted neighbourhood search. Computational experiments on two sets of problem instances are presented.

Suggested Citation

  • K S Hindi & K Pieńkosz, 1999. "Efficient solution of large scale, single-source, capacitated plant location problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(3), pages 268-274, March.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:3:d:10.1057_palgrave.jors.2600698
    DOI: 10.1057/palgrave.jors.2600698
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600698
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600698?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Ali Diabat & Jean-Philippe Richard & Craig Codrington, 2013. "A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design," Annals of Operations Research, Springer, vol. 203(1), pages 55-80, March.
    2. Mohammad M. Fazel-Zarandi & J. Christopher Beck, 2012. "Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 387-398, August.
    3. Vincent Tulasi & Isaac Kwasi Adu & Elikem Kofi Krampa, 2016. "Location of Farmers Warehouse at Adaklu Traditional Area, Volta Region, Ghana," Journal of Optimization, Hindawi, vol. 2016, pages 1-10, July.
    4. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.

    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:pal:jorsoc:v:50:y:1999:i:3:d:10.1057_palgrave.jors.2600698. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.