IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8163927.html
   My bibliography  Save this article

A Modified Priority-Based Encoding for Design of a Closed-Loop Supply Chain Network Using a Discrete League Championship Algorithm

Author

Listed:
  • Javid Ghahremani Nahr
  • Ramez Kian
  • Hassan Rezazadeh

Abstract

In a closed-loop supply chain network, the aim is to ensure a smooth flow of materials and attaining the maximum value from returning and end-of-life goods. This paper presents a single-objective deterministic mixed integer linear programming (MILP) model for the closed-loop supply chain (CLSC) network design problem consisting of plants, collection centers, disposal centers, and customer zones. Our model minimizes the total costs comprising fixed opening cost of plants, collection, disposal centers, and transportation costs of products among the nodes. As supply chain network design problems belong to the class of NP-hard problems, a novel league championship algorithm (LCA) with a modified priority-based encoding is applied to find a near-optimal solution. New operators are defined for the LCA to search the discrete space. Numerical comparison of our proposed encoding with the existing approaches in the literature is indicative of the high quality performance of the proposed encoding.

Suggested Citation

  • Javid Ghahremani Nahr & Ramez Kian & Hassan Rezazadeh, 2018. "A Modified Priority-Based Encoding for Design of a Closed-Loop Supply Chain Network Using a Discrete League Championship Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-16, May.
    • Handle: RePEc:hin:jnlmpe:8163927
    DOI: 10.1155/2018/8163927
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/8163927.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2018/8163927.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/8163927?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
    ---><---

    Citations

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


    Cited by:

    1. Luttiely Santos Oliveira & Ricardo Luiz Machado, 2021. "Application of optimization methods in the closed-loop supply chain: a literature review," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 357-400, February.

    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:hin:jnlmpe:8163927. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.