IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v4y2013i4p55-71.html
   My bibliography  Save this article

Multi-Level Programming Approach to a Closed-loop Supply Chain Network Design

Author

Listed:
  • Sima Ghayebloo

    (Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran)

  • Mohammad Jafar Tarok

    (Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran)

  • Mostafa Abedzadeh

    (Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran)

  • Claver Diallo

    (Department of Industrial Engineering, Dalhousie University, Halifax, Canada)

Abstract

In this paper, the authors address the problem of network design for a closed-loop supply chain. The problem is formulated as a mixed zero-one bi-level optimization model, with the manufacturer as the leader who minimizes his costs at the upper level, and a forwarding agent dealt with as the follower. The leader decides on the locations of the facilities, and the forwarding agent builds the forward and reverse transportation plans so as to minimize the total transportation cost. A genetic algorithm solution method is used to obtain the Stackelberg solution. Furthermore, the algorithm uses penalty functions to handle the constraints. The solution algorithm is implemented in Matlab, utilizing LINGO 11.0 (2008) to solve each lower level problem instance. Finally, the accuracy of the model is tested on a set of numerical experiments.

Suggested Citation

  • Sima Ghayebloo & Mohammad Jafar Tarok & Mostafa Abedzadeh & Claver Diallo, 2013. "Multi-Level Programming Approach to a Closed-loop Supply Chain Network Design," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 4(4), pages 55-71, October.
    • Handle: RePEc:igg:jsds00:v:4:y:2013:i:4:p:55-71
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijsds.2013100104
    Download Restriction: no
    ---><---

    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:igg:jsds00:v:4:y:2013:i:4:p:55-71. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.