NSGA-II algorithm-based automated cigarette finished goods storage level optimization research

Yewei Hu, Guangjun Dong, Bin Wang, Xiyao Liu, Jun Wen, Ming Dai, Zongrui Wu
{"title":"NSGA-II algorithm-based automated cigarette finished goods storage level optimization research","authors":"Yewei Hu,&nbsp;Guangjun Dong,&nbsp;Bin Wang,&nbsp;Xiyao Liu,&nbsp;Jun Wen,&nbsp;Ming Dai,&nbsp;Zongrui Wu","doi":"10.1002/adc2.171","DOIUrl":null,"url":null,"abstract":"<p>With the growth of Internet of Things technology, more and more businesses are implementing automated cargo storage systems. By using an appropriate automated storage space allocation model, these businesses can significantly reduce their storage pressure while saving money on logistics and increasing the effectiveness of their product distribution. Therefore, the study is based on the non-dominated sorting genetic algorithms II (non-dominated sorting genetic algorithm, NSGA II), which combines the three basic principles of space allocation as the objective function applied to the allocation model of the algorithm, in order to optimize the space model for automated storage of finished cigarettes. The algorithm is run to obtain 20 Pareto solutions and examine their three objective functions. The experiment's findings revealed, after optimizing the NSGA-II algorithm in this study, the average reduction rate of shipping efficiency is 32%, the average reduction rate of shelf stability is 54%, and the average reduction rate of product correlation is about 77%, indicating that the algorithm optimization is highly effective.</p>","PeriodicalId":100030,"journal":{"name":"Advanced Control for Applications","volume":"6 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/adc2.171","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Control for Applications","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/adc2.171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the growth of Internet of Things technology, more and more businesses are implementing automated cargo storage systems. By using an appropriate automated storage space allocation model, these businesses can significantly reduce their storage pressure while saving money on logistics and increasing the effectiveness of their product distribution. Therefore, the study is based on the non-dominated sorting genetic algorithms II (non-dominated sorting genetic algorithm, NSGA II), which combines the three basic principles of space allocation as the objective function applied to the allocation model of the algorithm, in order to optimize the space model for automated storage of finished cigarettes. The algorithm is run to obtain 20 Pareto solutions and examine their three objective functions. The experiment's findings revealed, after optimizing the NSGA-II algorithm in this study, the average reduction rate of shipping efficiency is 32%, the average reduction rate of shelf stability is 54%, and the average reduction rate of product correlation is about 77%, indicating that the algorithm optimization is highly effective.

Abstract Image

基于NSGA-II算法的卷烟成品自动化仓储水平优化研究
随着物联网技术的发展,越来越多的企业正在实施自动化货物存储系统。通过使用适当的自动化存储空间分配模型,这些企业可以显着减少其存储压力,同时节省物流资金并提高其产品分销的有效性。因此,本研究以非支配排序遗传算法II (non- dominant sorting genetic algorithm, NSGA II)为基础,结合空间分配的三个基本原则作为目标函数应用于算法的分配模型,对成品卷烟自动化存储的空间模型进行优化。算法得到了20个Pareto解,并检验了它们的三个目标函数。实验结果表明,本研究对NSGA-II算法进行优化后,运输效率的平均降低率为32%,货架稳定性的平均降低率为54%,产品相关性的平均降低率约为77%,表明算法优化是高效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.60
自引率
0.00%
发文量
0
×
引用
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学术官方微信