Skip to main navigation Skip to search Skip to main content

A Learning-based Iterated Local Search Algorithm for Order Batching and Sequencing Problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An order batching and sequencing problem in a warehouse is studied in this work. The problem is proved to be an NP-hard problem. A mathematical programming model is formulated to describe it clearly. To minimize tardiness, an improved iterated local search algorithm based on reinforcement learning is proposed. An operator selecting scheme, which aims to automatically select local search operator combinations instead of simply performing all the operators in each iteration, is designed to reduce the computational cost greatly. Besides, an adaptive perturbation mechanism is designed to improve its global search ability. Extensive simulation experimental results and comparisons with the state of the art demonstrate the high effectiveness and efficiency of the proposed approach.

Original languageEnglish
Title of host publication2022 IEEE 18th International Conference on Automation Science and Engineering, CASE 2022
PublisherIEEE Computer Society
Pages1741-1746
Number of pages6
ISBN (Electronic)9781665490429
DOIs
StatePublished - 2022
Externally publishedYes
Event18th IEEE International Conference on Automation Science and Engineering, CASE 2022 - Mexico City, Mexico
Duration: 20 Aug 202224 Aug 2022

Publication series

NameIEEE International Conference on Automation Science and Engineering
Volume2022-August
ISSN (Print)2161-8070
ISSN (Electronic)2161-8089

Conference

Conference18th IEEE International Conference on Automation Science and Engineering, CASE 2022
Country/TerritoryMexico
CityMexico City
Period20/08/2224/08/22

Fingerprint

Dive into the research topics of 'A Learning-based Iterated Local Search Algorithm for Order Batching and Sequencing Problems'. Together they form a unique fingerprint.

Cite this