Author
Listed:
- Hao Guo
- Xiaomei Lai
- Ju Guo
- Ge You
- Ibrahim Alnafrah
Abstract
Customer returns are an unavoidable and increasingly costly challenge in business operations, especially in online marketplaces. This study addresses this issue by introducing a practical multi-supplier closed-loop location-inventory problem (CLLIP) that incorporates customer returns. The objective of the CLLIP is to minimize overall supply chain costs by optimizing facility location and inventory management strategies. To solve this complex problem, an improved hybrid artificial bee colony algorithm (IHABC) is proposed, which integrates two novel search equations to generate candidate solutions during the employed bee and onlooker bee phases, effectively balancing exploration and exploitation. The performance of IHABC is evaluated against various artificial bee colony variants as well as the commercial solver Lingo. The results of numerical experiments demonstrate that IHABC consistently outperforms competing methods, achieving superior solutions with the lowest mean values and optimal total cost results, while also requiring less computation time. The results of numerical experiments demonstrate that IHABC consistently outperforms competing methods, achieving up to 29.97% improvement in solution quality over the standard ABC algorithm. These findings confirm that IHABC is a highly effective and efficient tool for solving the proposed CLLIP. Furthermore, a sensitivity analysis is conducted to provide actionable insights, enabling managers to make informed and strategic decisions in real-world supply chain operations.
Suggested Citation
Hao Guo & Xiaomei Lai & Ju Guo & Ge You & Ibrahim Alnafrah, 2025.
"An improved hybrid artificial bee colony algorithm for a multi-supplier closed-loop location inventory problem with customer returns,"
PLOS ONE, Public Library of Science, vol. 20(5), pages 1-27, May.
Handle:
RePEc:plo:pone00:0324343
DOI: 10.1371/journal.pone.0324343
Download full text from publisher
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:plo:pone00:0324343. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.