IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v342y2024i1d10.1007_s10479-023-05219-3.html
   My bibliography  Save this article

An optimization model with a lagrangian relaxation algorithm for artificial internet of things-enabled sustainable circular supply chain networks

Author

Listed:
  • Madjid Tavana

    (La Salle University
    University of Paderborn)

  • Arash Khalili Nasr

    (Sharif University of Technology)

  • Francisco J. Santos-Arteaga

    (Universidad Complutense de Madrid)

  • Esmaeel Saberi

    (Tarbiat Modares University)

  • Hassan Mina

    (Shanghai Maritime University)

Abstract

Circular supply chain (CSC) networks improve sustainability and create socially responsible enterprises through recycling, harvesting, and refurbishing. This study develops a Lagrangian relaxation (LR) algorithm for solving location-inventory-routing (LIR) problems with heterogeneous vehicles in multi-period and multi-product sustainable CSC networks. The proposed Artificial Internet of Things (AIoT) enabled sustainable CSC is designed to increase network performance and create a secure and traceable environment. For the first time, an LR algorithm is proposed to solve the LIR problems in an AIoT-enabled CSC network with storage, backorder shortage, split-delivery, and time window potentials. Sixteen small- and medium-size simulated problems were produced to assess the performance of the proposed algorithm relative to the GAMS software. The results show the proposed algorithm can solve the small- and medium-size problems as effectively as GAMS software but faster and more efficiently. In addition, eight large-size simulation problems were produced and solved by the algorithm. While the GAMS software failed to solve the large-size problems, the LR algorithm solved them efficiently and successfully.

Suggested Citation

  • Madjid Tavana & Arash Khalili Nasr & Francisco J. Santos-Arteaga & Esmaeel Saberi & Hassan Mina, 2024. "An optimization model with a lagrangian relaxation algorithm for artificial internet of things-enabled sustainable circular supply chain networks," Annals of Operations Research, Springer, vol. 342(1), pages 767-802, November.
    • Handle: RePEc:spr:annopr:v:342:y:2024:i:1:d:10.1007_s10479-023-05219-3
    DOI: 10.1007/s10479-023-05219-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05219-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05219-3?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
    ---><---

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

    References listed on IDEAS

    as
    1. Niu, Huimin & Zhou, Xuesong & Tian, Xiaopeng, 2018. "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 70-101.
    2. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    3. Zhang, Zhi-Hai & Jiang, Hai & Pan, Xunzhang, 2012. "A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain," International Journal of Production Economics, Elsevier, vol. 140(1), pages 249-255.
    4. Chen Chao & Tian Zhihui & Yao Baozhen, 2019. "Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network," Annals of Operations Research, Springer, vol. 273(1), pages 111-134, February.
    5. Zheng, Xiaojin & Yin, Meixia & Zhang, Yanxia, 2019. "Integrated optimization of location, inventory and routing in supply chain network design," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 1-20.
    6. Shahriar Akter & Katina Michael & Muhammad Rajib Uddin & Grace McCarthy & Mahfuzur Rahman, 2022. "Transforming business using digital innovations: the application of AI, blockchain, cloud and data analytics," Annals of Operations Research, Springer, vol. 308(1), pages 7-39, January.
    7. Shiva Zandkarimkhani & Hassan Mina & Mehdi Biuki & Kannan Govindan, 2020. "A chance constrained fuzzy goal programming approach for perishable pharmaceutical supply chain network design," Annals of Operations Research, Springer, vol. 295(1), pages 425-452, December.
    8. Sumit Kunnumkal & Kalyan Talluri, 2019. "A strong Lagrangian relaxation for general discrete-choice network revenue management," Computational Optimization and Applications, Springer, vol. 73(1), pages 275-310, May.
    9. Zhao, Jiahong & Ke, Ginger Y., 2017. "Incorporating inventory risks in location-routing models for explosive waste management," International Journal of Production Economics, Elsevier, vol. 193(C), pages 123-136.
    10. Purva Grover & Arpan Kumar Kar & Yogesh K. Dwivedi, 2022. "Understanding artificial intelligence adoption in operations management: insights from the review of academic literature and social media discussions," Annals of Operations Research, Springer, vol. 308(1), pages 177-213, January.
    11. Shivam Gupta & Sachin Modgil & Samadrita Bhattacharyya & Indranil Bose, 2022. "Artificial intelligence for decision support systems in the field of operations research: review and future scope of research," Annals of Operations Research, Springer, vol. 308(1), pages 215-274, January.
    12. Zhang, Zhi-Hai & Unnikrishnan, Avinash, 2016. "A coordinated location-inventory problem in closed-loop supply chain," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 127-148.
    13. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lihua Liu & Lai Soon Lee & Hsin-Vonn Seow & Chuei Yee Chen, 2022. "Logistics Center Location-Inventory-Routing Problem Optimization: A Systematic Review Using PRISMA Method," Sustainability, MDPI, vol. 14(23), pages 1-39, November.
    2. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    3. Tran, Trung Hieu & Nguyen, Thu Ba T. & Le, Hoa Sen T. & Phung, Duc Chinh, 2024. "Formulation and solution technique for agricultural waste collection and transport network design," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1152-1169.
    4. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    5. Dollevoet, Twan & van Essen, J. Theresia & Glorie, Kristiaan M., 2018. "Solution methods for the tray optimization problem," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1070-1084.
    6. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
    7. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    8. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    9. Zhang, Zheng & Wei, Yongqi & Xiong, Youming & Peng, Geng & Wang, Guorong & Lu, Jingsheng & Zhong, Lin & Wang, Jingpeng, 2022. "Influence of the location of drilling fluid loss on wellbore temperature distribution during drilling," Energy, Elsevier, vol. 244(PB).
    10. Jabbarzadeh, Armin & Fahimnia, Behnam & Sheu, Jiuh-Biing & Moghadam, Hani Shahmoradi, 2016. "Designing a supply chain resilient to major disruptions and supply/demand interruptions," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 121-149.
    11. Junming Liu & Weiwei Chen & Jingyuan Yang & Hui Xiong & Can Chen, 2022. "Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 769-789, March.
    12. Springborn, Michael R., 2014. "Risk aversion and adaptive management: Insights from a multi-armed bandit model of invasive species risk," Journal of Environmental Economics and Management, Elsevier, vol. 68(2), pages 226-242.
    13. Li, Wenjie & Yang, Lixing & Wang, Li & Zhou, Xuesong & Liu, Ronghui & Gao, Ziyou, 2017. "Eco-reliable path finding in time-variant and stochastic networks," Energy, Elsevier, vol. 121(C), pages 372-387.
    14. G. Rius-Sorolla & J. Maheut & Jairo R. Coronado-Hernandez & J. P. Garcia-Sabater, 2020. "Lagrangian relaxation of the generic materials and operations planning model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 105-123, March.
    15. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
    16. Vasile BRÄ‚TIAN, 2018. "Portfolio Optimization. Application of the Markowitz Model Using Lagrange and Profitability Forecast," Expert Journal of Economics, Sprint Investify, vol. 6(1), pages 26-34.
    17. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    18. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    19. Mahnaz Sheikholeslami & Naeme Zarrinpoor, 2024. "Designing a robust logistics model for perishable emergency commodities in an epidemic outbreak using Lagrangian relaxation: a case of COVID-19," Annals of Operations Research, Springer, vol. 343(1), pages 459-491, December.
    20. Xie, Siyang & An, Kun & Ouyang, Yanfeng, 2019. "Planning facility location under generally correlated facility disruptions: Use of supporting stations and quasi-probabilities," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 115-139.

    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:annopr:v:342:y:2024:i:1:d:10.1007_s10479-023-05219-3. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.