Log In Sign Up

Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

by   Lin Xie, et al.

Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both single-line and multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions are proposed in the literature and in practice. For example, in a mixed-shelves storage policy, items of the same stock keeping unit are spread over several shelves in a warehouse; or automated guided vehicles (AGVs) are used to transport the picked items from the storage area to packing stations instead of human pickers. This is the first paper to combine both solutions, creating what we call AGV-assisted mixed-shelves picking systems. We model the new integrated order batching and routing problem in such systems as an extended multi-depot vehicle routing problem with both three-index and two-commodity network flow formulations. Due to the complexity of the integrated problem, we develop a novel variable neighborhood search algorithm to solve the integrated problem more efficiently. We test our methods with different sizes of instances, and conclude that the mixed-shelves storage policy is more suitable than the usual storage policy in AGV-assisted mixed-shelves systems for both single-line and multi-line orders (saving up to 67 variable neighborhood search algorithm provides close-to-optimal solutions within an acceptable computational time.


page 2

page 13

page 26

page 27


Efficient order picking methods in robotic mobile fulfillment systems

Robotic mobile fulfillment systems (RMFSs) are a new type of warehousing...

Solving the Joint Order Batching and Picker Routing Problem for Large Instances

In this work, we investigate the problem of order batching and picker ro...

Integration of returns and decomposition of customer orders in e-commerce warehouses

In picker-to-parts warehouses, order picking is a cost- and labor-intens...

Modeling Single Picker Routing Problems in Classical and Modern Warehouses

The standard single picker routing problem (SPRP) seeks the cost-minimal...

Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

Bin Packing with Conflicts (BPC) are problems in which items with compat...

A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System

Packing cost accounts for a large part of the e-commerce logistics cost....

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions

Block stacking storage systems are highly adaptable warehouse systems wi...