IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v25y2023i4p463-491.html
   My bibliography  Save this article

Comparing different types of robust possibilistic programming approaches in designing closed-loop networks

Author

Listed:
  • Mona Bahrami
  • Mehdi Seifbarghy
  • Mohsen Hamidi
  • Farshad Faghihzade

Abstract

This paper introduces a multi-objective, multi-product, and multi-period closed-loop supply chain network model with uncertainty. The network includes suppliers, plants, distribution centres, hybrid processing centres, and customers in its forward chain while in the backward chain; it is composed of customers, collection centres, disposal centres, hybrid processing centres, and plants. The problem has three objectives for optimising profit: delivery time, and quality. With these three objectives, the model creates a balance between customer satisfaction and business profitability. The model also considers the impact of average useful life of products on their return. We use several types of robust possibilistic approaches and multi-choice goal programming to tackle uncertainty and the multi-objective nature of the problem. The model is applicable in a variety of businesses such as automobile, electrical, and electronic industries.

Suggested Citation

  • Mona Bahrami & Mehdi Seifbarghy & Mohsen Hamidi & Farshad Faghihzade, 2023. "Comparing different types of robust possibilistic programming approaches in designing closed-loop networks," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 25(4), pages 463-491.
    • Handle: RePEc:ids:ijmore:v:25:y:2023:i:4:p:463-491
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=132835
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijmore:v:25:y:2023:i:4:p:463-491. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.