Formulating and Solving Integrated Order Picking and Routing in AVS/RS

This paper studies an integrated order picking and routing (IOPR) problem in Autonomous Vehicle Storage and Retrieval Systems (AVS/RS), which addresses the joint optimization of order allocation, the sequencing of shuttle robot movements, and elevator scheduling. To solve this problem, we build the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Chinese Control Conference s. 2406 - 2413
Hlavní autoři: Chu, Wenqing, Zhou, Xuan, Shi, Xiang, Jiang, Jingchen, Dong, Wei, Deng, Fang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Technical Committee on Control Theory, Chinese Association of Automation 28.07.2025
Témata:
Adaptation models
Autonomous Vehicle Storage and Retrieval Systems
Combinatorial Optimization
Computational efficiency
Computational modeling
Elevators
Maintenance engineering
Optimization
Order Picking
Resource management
Robots
Routing
Search problems
Shuttle robots
ISSN:1934-1768
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper studies an integrated order picking and routing (IOPR) problem in Autonomous Vehicle Storage and Retrieval Systems (AVS/RS), which addresses the joint optimization of order allocation, the sequencing of shuttle robot movements, and elevator scheduling. To solve this problem, we build the mixed-integer linear programming model and propose an order-to-storage allocation algorithm (OSAA). In OSAA, five destruction and two repair operators with problem-specific knowledge and an adaptive search mechanism are designed to get the order-to-storage allocation. Each solution is evaluated by a routing-transformation strategy, which transforms the routing problem of shuttle robots and elevators into a traveling salesman problem and subsequently solves it. Experimental results demonstrate that the proposed approach significantly improves solution quality and computational efficiency compared to traditional methods.
ISSN:1934-1768
DOI:10.23919/CCC64809.2025.11178979