返回
MULTI-OBJECTIVE GROUPING GENETIC ALGORITHM FOR THE JOINT ORDER BATCHING, BATCH ASSIGNMENT, AND SEQUENCING PROBLEM
DOI:10.1080/17509653.2021.1991852.png)
摘要
En 中文
This article solves the order batching, batch assignment, and sequencing problem (JOBASP) given multiple objectives and heterogeneous picking vehicles in multi-parallel-aisle warehouse systems. A multi-objective grouping genetic algorithm (GGA) is developed to minimize total travel time and total tardiness by implementing an encoding scheme where a gene represents orders grouped in a batch and the assignment of the batch to a picking vehicle. Computer simulations show that the proposed algorithm performs 25.4% better than a first come, first served (FCFS) rule-based heuristic and 10.2% better than an earliest due date (EDD) rule-based heuristic. The proposed GGA provides significant savings of up to 46.8% and 28.4% on travel time and tardiness, respectively, for these benchmark heuristics. Therefore, this article introduces a GGA to solve the JOBASP with a reasonable computing time, making this approach interesting for warehouse operators using heterogeneous picking vehicles and addressing multiple objectives.
Keyword:
Order picking
order batching
batch assignment
sequencing
grouping genetic algorithms
multi-objective problem
joint order picking
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
242
被引数:
739
机构
引用论文
Wheel profile optimization procedure to minimize flange wear considering profile wear evolution考虑轮廓磨损演化的车轮轮廓优化程序以最小化轮缘磨损
Bacterial Memetic Algorithms for Order Picking Routing Problem with Loading Constraints带负荷约束的订单拣选路径问题的细菌模因算法
H+-selective electrodes based on neutral carriers: Specific features in behaviour and quantitative description of the electrode response
Talanta
IF0

