{"title":"综合订单分批、拣选器分配、批次排序和拣选器路径问题的学习辅助迭代局部搜索算法","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":"{\"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}","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}
Learning-Aided Iterated Local Search Algorithm for Integrated Order Batching, Picker Assignment, Batch Sequencing, and Picker Routing Problem
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.
期刊介绍:
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.