Learning-Aided Iterated Local Search Algorithm for Integrated Order Batching, Picker Assignment, Batch Sequencing, and Picker Routing Problem

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Automation Science and Engineering Pub Date : 2024-10-23 DOI:10.1109/TASE.2024.3477982
ZhengCai Cao;XinSai Lv;ChengRan Lin
{"title":"Learning-Aided Iterated Local Search Algorithm for Integrated Order Batching, Picker Assignment, Batch Sequencing, and Picker Routing Problem","authors":"ZhengCai Cao;XinSai Lv;ChengRan Lin","doi":"10.1109/TASE.2024.3477982","DOIUrl":null,"url":null,"abstract":"This work tackles an integrated order batching, picker assignment, batch sequencing, and picker routing problem in warehouse environments. A Learning-Aided Iterated Local Search (LILS) is proposed to efficiently find its high-quality solutions. The main optimizer is iterated local search. A novel bidirectional long short-term memory network-embedded autoencoder, built through end-to-end unsupervised learning with an encoder and decoder, guides the search direction. To capture the implicit relationships among strongly-coupled subproblems, long short-term memory layers are incorporated in the encoder. A network-aided mutation operator is introduced to enhance global search in a low-dimensional feature space. In the decoder, low-order and high-fit subsolutions are identified and reconstructed to generate mutated offspring solutions using long short-term memory layers and a masking mechanism. To balance the exploration and exploitation of LILS, an information exchange method is developed. Numerical experiments show that LILS outperforms several existing methods in generating high-quality schedules within a reasonable time. Note to Practitioners—In a warehouse environment, an integrated optimization problem is often addressed by using heuristics due to limited computational resources. However, expedient heuristic rules tend to produce subpar results. While meta-heuristics can generate relatively better schedules, they are time-consuming, particularly for population-based algorithms that must iteratively evaluate fitness functions for numerous candidate solutions. In order to strike a balance between computational demands and solution-qualities, our approach combines machine learning techniques with meta-heuristics. Specifically, we integrate a bidirectional long short-term memory-based autoencoder into iterated local search to enhance the latter’s global optimization capability. The integration of machine learning and meta-heuristics enables efficient generation of superior schedules in a limited time. Various experimental results demonstrate that the proposed method significantly outperforms its recently-developed competitive peers, thus greatly facilitating the efficient operation of a smart warehouse.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"7421-7434"},"PeriodicalIF":6.4000,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10731543/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This work tackles an integrated order batching, picker assignment, batch sequencing, and picker routing problem in warehouse environments. A Learning-Aided Iterated Local Search (LILS) is proposed to efficiently find its high-quality solutions. The main optimizer is iterated local search. A novel bidirectional long short-term memory network-embedded autoencoder, built through end-to-end unsupervised learning with an encoder and decoder, guides the search direction. To capture the implicit relationships among strongly-coupled subproblems, long short-term memory layers are incorporated in the encoder. A network-aided mutation operator is introduced to enhance global search in a low-dimensional feature space. In the decoder, low-order and high-fit subsolutions are identified and reconstructed to generate mutated offspring solutions using long short-term memory layers and a masking mechanism. To balance the exploration and exploitation of LILS, an information exchange method is developed. Numerical experiments show that LILS outperforms several existing methods in generating high-quality schedules within a reasonable time. Note to Practitioners—In a warehouse environment, an integrated optimization problem is often addressed by using heuristics due to limited computational resources. However, expedient heuristic rules tend to produce subpar results. While meta-heuristics can generate relatively better schedules, they are time-consuming, particularly for population-based algorithms that must iteratively evaluate fitness functions for numerous candidate solutions. In order to strike a balance between computational demands and solution-qualities, our approach combines machine learning techniques with meta-heuristics. Specifically, we integrate a bidirectional long short-term memory-based autoencoder into iterated local search to enhance the latter’s global optimization capability. The integration of machine learning and meta-heuristics enables efficient generation of superior schedules in a limited time. Various experimental results demonstrate that the proposed method significantly outperforms its recently-developed competitive peers, thus greatly facilitating the efficient operation of a smart warehouse.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
综合订单分批、拣选器分配、批次排序和拣选器路径问题的学习辅助迭代局部搜索算法
这项工作解决了仓库环境中集成的订单批处理、拾取器分配、批排序和拾取器路由问题。提出了一种学习辅助迭代局部搜索(LILS)方法来高效地寻找高质量的解。主要的优化器是迭代局部搜索。一种新型的双向长短期记忆网络嵌入式自编码器,通过端到端无监督学习构建,具有编码器和解码器,指导搜索方向。为了捕捉强耦合子问题之间的隐式关系,编码器中加入了长短期记忆层。在低维特征空间中引入网络辅助变异算子增强全局搜索能力。在解码器中,利用长短期记忆层和掩蔽机制对低阶和高拟合子解进行识别和重构,以产生突变的后代解。为了平衡lls的开发和利用,提出了一种信息交换方法。数值实验表明,LILS在合理时间内生成高质量调度方面优于现有的几种方法。从业人员注意事项——在仓库环境中,由于计算资源有限,集成优化问题通常通过使用启发式来解决。然而,权宜之计启发式规则往往产生次等的结果。虽然元启发式可以生成相对更好的调度,但它们非常耗时,特别是对于必须迭代地评估众多候选解决方案的适应度函数的基于种群的算法。为了在计算需求和解决方案质量之间取得平衡,我们的方法将机器学习技术与元启发式相结合。具体而言,我们将基于双向长短期记忆的自编码器集成到迭代局部搜索中,以增强后者的全局优化能力。机器学习和元启发式的集成可以在有限的时间内有效地生成优越的时间表。各种实验结果表明,该方法明显优于最近开发的竞争对手,从而极大地促进了智能仓库的高效运行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
期刊最新文献
Optimal Non-anticipative All-scenario-feasible Scheduling Strategy for Community Microgrid with Vehicle-to-grid Energy Storages Incremental Q-Learning for Data-Driven Adaptive Critic Control of Wastewater Treatment Processes With State Constraints Automated Instance Segmentation Network for Overlapping Cells in Cleavage-Stage Embryos Fixed-Time Performance Fault-Tolerant Control for Cluster Synchronization of Spatiotemporal Networks with Sign-Based Coupling Distributed Coverage Control for Air-Ground Robot Systems with Heterogeneous Sensing Capabilities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1