Skip to content
Open access

Human–Robot Collaborative Order Picking in Smart Warehouses with Fuzzy Transportation and Processing Time

Sep 2026 · Mathematics · Vol 14, pp. 3295 · 0 citations

TL;DR

This work model the concerned problem with the objective of minimizing fuzzy makespan and design an adaptive large-neighborhood-based variable neighborhood descent algorithm to efficiently solve it, which adopts three-dimensional coupling encoding and multi-stage heuristic decoding mechanisms.

Abstract

Robot mobile fulfillment systems (RMFSs), as human–robot collaborative smart warehouses, transform the traditional person-to-goods order picking mode into a goods-to-person mode. Order picking optimization is a core decision-making challenge in RMFSs to improve the efficiency of the system, which needs to jointly optimize pod selection, robot scheduling, station assignment, and manual picking. Although recent studies have widely investigated integrated operational optimization in RMFSs, most of them rely on deterministic transportation and processing time and ignore uncertainties in practical human–robot collaborative operations. It remains challenging to jointly optimize these coupled decisions under uncertain operation times. To address this challenge, we model the concerned problem with the objective of minimizing fuzzy makespan and design an adaptive large-neighborhood-based variable neighborhood descent algorithm to efficiently solve it. The algorithm adopts three-dimensional coupling encoding and multi-stage heuristic decoding mechanisms. It further integrates a learning-based adaptive destroy operator selection method and a variable neighborhood descent search strategy to enhance its exploration and exploitation abilities. In a large number of systematic experiments, ALVND achieved great performance in solving the concerned problem. The objective function value obtained by it was 5.6–25.1% lower than its competitors, demonstrating its effectiveness in uncertain human–robot collaborative warehouse scenarios.

Read PDF

Similar papers

Open access Oct 2026

Improving human–robot collaboration in AMR-assisted warehouse picking

In AMR-assisted picker-to-parts warehouses, performance loss arises not only from inefficient robot tours but also from poor synchronization between AMR arrivals and picker readiness at handover points. To address these problems, prior research has largely emphasized batching, routing, and sequencing, with limited at...

Vivek D. Sangani, S. Nof · 0 citations
Conference Open access 2026

Conflict Resolution and Real-Time Coordination Methods for Collaborative Trajectory Planning of Robot Swarms in Dynamic Warehouse Environments

Trajectory planning has become an indispensable part of mobile robots performing tasks in smart warehouses. Multi-robot systems have been successfully applied in many application fields. In large warehouse robot cooperation scenes, Path planning and conflict solving are the key technical problems affecting system perfo...

Siqi Shen · 0 citations
Open access Sep 2026

Hierarchical Reinforcement Learning for Multi-Robot Task Allocation and Path Planning in Digital Twin Enabled Smart Warehouses

As more companies embrace the use of autonomous mobile robots to organize their smart warehouses, one of the major issues facing them is the coordination of these fleets under very restrictive throughputs. Task allocation and path planning go hand in hand: if tasks are assigned without considering congestion, then ea...

Mohanad Ibrahim Elassadi · 0 citations
Open access Sep 2026

Optimizing Robot Selection in Manufacturing: A WASPAS Approach for Multi-Criteria Decision-Making

Choosing the most suitable robot from multiple options is a challenging task in multi-criteria decision-making (MCDM). This study highlights the application of the WASPAS method, which integrates the Weighted Sum Model and the Weighted Product Model with additive and multiplicative components, to address a real-world r...

Devipriya Mani · 0 citations
Open access Aug 2026

A Computational Intelligence Approach for the Energy-Efficient Hybrid Flow Shop Scheduling Problem with Deteriorating Maintenance and Transportation Times

Experiments show that the adaptive feedback multi-start variable neighborhood search (AFMS-VNS) algorithm outperforms five comparison algorithms in terms of inverted generational distance, hypervolume, and set coverage when solving the EHFSP-DMT.

Yan Wang, Ya-Bo Wei, Huanli Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.