IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_27.html
   My bibliography  Save this book chapter

An LP-based Heuristic Approach for Strategic Supply Chain Design

In: Operations Research Proceedings 2005

Author

Listed:
  • Rafael Velásquez

    (Fraunhofer Institute for Industrial Mathematics (ITWM))

  • M. Teresa Melo

    (Fraunhofer Institute for Industrial Mathematics (ITWM))

  • Stefan Nickel

    (Fraunhofer Institute for Industrial Mathematics (ITWM)
    Saarland University)

Abstract

Summary A novel heuristic approach is proposed for solving a large scale facility location problem arising in supply chain design. The problem formulation includes many practical aspects such as a dynamic planning horizon, generic supply chain structure, inventory and distribution of goods, budget constraints, and storage limitations. Moreover, facility location decisions are modelled through the gradual relocation of existing facilities to new sites over a given planning horizon. The heuristic approach explores the solution of the linear relaxation of the problem. It successively rounds the fractional variables corresponding to the 0/1 decisions of changing the facilities’ status (i.e., open new / close existing facilities), and it is also used to roughly estimate the total number of facility configuration changes over the planning horizon. The proposed heuristic performs very well on a large set of randomly generated problems, producing feasible solutions that on average only deviate 1.4% from the optimum.

Suggested Citation

  • Rafael Velásquez & M. Teresa Melo & Stefan Nickel, 2006. "An LP-based Heuristic Approach for Strategic Supply Chain Design," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 167-172, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_27
    DOI: 10.1007/3-540-32539-5_27
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-540-32539-0_27. 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.springer.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.