The Research on Distance Optimization of Batch-Order Picking Based on GA
Jie Wan, Shaoqing Zhang
Abstract
Jie Wan, Shaoqing Zhang
Abstract
In this paper we address the problem of batching orders in a parallel-aisle warehouse, with the objective to minimize the travel distance of picking all of the batches. This study develops an order batching approach based on genetic algorithms (GAs). Unlike to previous batching methods, in this paper it pays attention on the selection of seed orders. And it obviously reduce the distance of picking compared with other approach.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we address the problem of batching orders in a parallel-aisle warehouse, with the objective to minimize the travel distance of picking all of the batches. This study develops an order batching approach based on genetic algorithms (GAs). Unlike to previous batching methods, in this paper it pays attention on the selection of seed orders. And it obviously reduce the distance of picking compared with other approach.
Key concepts: Aisle, Order picking, Selection (genetic algorithm), Computer science, Genetic algorithm, Order (exchange), Mathematical optimization, Warehouse