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

2021-01-27 · Lin Xie, Hanyi Li, Laurin Luttmann

Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both small-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 orders with different sizes of order lines (saving up to 62% on driving distances for AGVs). Our variable neighborhood search algorithm provides optimal solutions within an acceptable computational time.

📄 PDF Abstract BibTeX arXiv:2101.11473

Code (1)

xor-lab/rafs-datasets 공식 구현

Solving the Order Batching and Sequencing Problem using Deep Reinforcement Learning

2020-06-16 · Bram Cals, Yingqian Zhang, Remco Dijkman, Claudy van Dorst

In e-commerce markets, on time delivery is of great importance to customer satisfaction. In this paper, we present a Deep Reinforcement Learning (DRL) approach for deciding how and when orders should be batched and picke…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

GANGR: GAN-Assisted Scalable and Efficient Global Routing Parallelization

2025-11-21 · Hadi Khodaei Jooshin, Inna Partin-Vaisband arxiv

Global routing is a critical stage in electronic design automation (EDA) that enables early estimation and optimization of the routability of modern integrated circuits with respect to congestion, power dissipation, and …

SCDA: School Compatibility Decomposition Algorithm for Solving the Multi-School Bus Routing and Scheduling Problem

2017-11-01 · Zhongxiang Wang, Ali Shafahi, Ali Haghani

Safely serving the school transportation demand with the minimum number of buses is one of the highest financial goals of school transportation directors. To achieve that objective, a good and efficient way to solve the …

Scheduling

CFR-RL: Traffic Engineering with Reinforcement Learning in SDN

2020-04-24 · Jun-Jie Zhang, Minghao Ye, Zehua Guo, Chen-Yu Yen 외

Traditional Traffic Engineering (TE) solutions can achieve the optimal or near-optimal performance by rerouting as many flows as possible. However, they do not usually consider the negative impact, such as packet out of …

Reinforcement Learning Reinforcement Learning (RL)

Robust Batch-Level Query Routing for Large Language Models under Cost and Capacity Constraints

2026-03-25 · Jelena Markovic-Voronov, Kayhan Behdin, Yuanda Xu, Zhengze Zhou 외 arxiv

We study the problem of routing queries to large language models (LLMs) under cost, GPU resources, and concurrency constraints. Prior per-query routing methods often fail to control batch-level cost, especially under non…