基于q学习的多仓库联合补货配送优化算法

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Lu Peng , Sirui Wang
{"title":"基于q学习的多仓库联合补货配送优化算法","authors":"Lu Peng ,&nbsp;Sirui Wang","doi":"10.1016/j.asoc.2025.113307","DOIUrl":null,"url":null,"abstract":"<div><div>The joint replenishment and delivery (JRD) strategy is critical for increasing operational management efficiency and reducing costs. This study introduces a new multi-warehouse JRD model for heterogeneous products. The main goal of the JRD strategy is to minimize costs by determining the optimal replenishment intervals, delivery frequency, and basic replenishment cycle time. To address the difficulties of the JRD optimization issue, we propose the Q-learning-based arithmetic optimization algorithm (QAOA). In the QAOA framework, Q-learning is the guiding principle, making decisions based on current conditions and constantly refining search strategy via feedback mechanisms. Furthermore, an escape mechanism has been implemented to reduce the possibility of algorithmic stagnation in local optima. Experiments show that QAOA exceeds eight popular benchmark algorithms. By employing the QAOA technique, the practical JRD model has been effectively handled, resulting in considerable cost reductions in supply chain management.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"178 ","pages":"Article 113307"},"PeriodicalIF":7.2000,"publicationDate":"2025-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Q-learning based arithmetic optimization algorithm for a multi-warehouse joint replenishment and delivery problem\",\"authors\":\"Lu Peng ,&nbsp;Sirui Wang\",\"doi\":\"10.1016/j.asoc.2025.113307\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The joint replenishment and delivery (JRD) strategy is critical for increasing operational management efficiency and reducing costs. This study introduces a new multi-warehouse JRD model for heterogeneous products. The main goal of the JRD strategy is to minimize costs by determining the optimal replenishment intervals, delivery frequency, and basic replenishment cycle time. To address the difficulties of the JRD optimization issue, we propose the Q-learning-based arithmetic optimization algorithm (QAOA). In the QAOA framework, Q-learning is the guiding principle, making decisions based on current conditions and constantly refining search strategy via feedback mechanisms. Furthermore, an escape mechanism has been implemented to reduce the possibility of algorithmic stagnation in local optima. Experiments show that QAOA exceeds eight popular benchmark algorithms. By employing the QAOA technique, the practical JRD model has been effectively handled, resulting in considerable cost reductions in supply chain management.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"178 \",\"pages\":\"Article 113307\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625006180\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625006180","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

联合补给和交付战略对提高业务管理效率和降低成本至关重要。本文提出了一种新的异构产品多仓库JRD模型。JRD战略的主要目标是通过确定最佳补货间隔、交货频率和基本补货周期时间来最小化成本。为了解决JRD优化问题的难点,我们提出了基于q学习的算法优化算法(QAOA)。在QAOA框架中,Q-learning是指导原则,根据当前情况做出决策,并通过反馈机制不断完善搜索策略。此外,为了减少算法在局部最优处停滞的可能性,还实现了一种逃逸机制。实验表明,QAOA算法优于8种常用的基准算法。通过采用QAOA技术,有效地处理了实际的JRD模型,从而大大降低了供应链管理的成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Q-learning based arithmetic optimization algorithm for a multi-warehouse joint replenishment and delivery problem
The joint replenishment and delivery (JRD) strategy is critical for increasing operational management efficiency and reducing costs. This study introduces a new multi-warehouse JRD model for heterogeneous products. The main goal of the JRD strategy is to minimize costs by determining the optimal replenishment intervals, delivery frequency, and basic replenishment cycle time. To address the difficulties of the JRD optimization issue, we propose the Q-learning-based arithmetic optimization algorithm (QAOA). In the QAOA framework, Q-learning is the guiding principle, making decisions based on current conditions and constantly refining search strategy via feedback mechanisms. Furthermore, an escape mechanism has been implemented to reduce the possibility of algorithmic stagnation in local optima. Experiments show that QAOA exceeds eight popular benchmark algorithms. By employing the QAOA technique, the practical JRD model has been effectively handled, resulting in considerable cost reductions in supply chain management.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信