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

Designing an Agile Closed-Loop Supply Chain with Environmental Aspects Using a Novel Multiobjective Metaheuristic Algorithm

Author

Listed:
  • Liu Kai
  • Ramina Malekalipour Kordestanizadeh

Abstract

Success in supply chain implementation depends on the way of dealing with market changes and customer needs. Agility is a concept that has been introduced in recent years to improve the supply chain. On the other hand, paying attention to environmental problems is another issue, and chains are trying to increase their popularity by focusing on this issue. Considering the importance of this issue, designing a multiobjective closed-loop supply chain network has been discussed in this research. The main contribution of this research is the integration of green and agility concepts in supply chain design. In this regard, a mathematical model is presented with economic, environmental, and agility objectives. First, the mathematical model is solved using the Epsilon constraint method, and then, the multiobjective weed algorithm is proposed to solve the model. The results of comparisons between the two methods show that the multiobjective weed algorithm has performed well in terms of various metrics of NPS, SNS, and Max Spread. In terms of the solving time, the average solving time of this algorithm was about 0.1% of the solving time of the Epsilon constraint method. Moreover, all cases show the superiority of the multiobjective weed algorithm over the Epsilon constraint method in solving the proposed mathematical model.

Suggested Citation

  • Liu Kai & Ramina Malekalipour Kordestanizadeh, 2021. "Designing an Agile Closed-Loop Supply Chain with Environmental Aspects Using a Novel Multiobjective Metaheuristic Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-13, November.
  • Handle: RePEc:hin:jnlmpe:3811417
    DOI: 10.1155/2021/3811417
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/3811417.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/3811417.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/3811417?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
    ---><---

    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:3811417. 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.