.png){kind=icon}
.png){kind=icon}
Return
A simulation-based genetic algorithm for a semi-automated warehouse scheduling problem with processing time variability
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.111713.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For warehouse operations, efficiently scheduling the available resources is crucial to improve the productivity and customer satisfaction. This paper proposes a simulation-based evolutionary algorithm for order scheduling and multi-robot task assignment in a robotic mobile fulfillment system. The algorithm proactively deals with the effects of the processing time variability by evaluating schedules based on both its system performance as well as its robustness under uncertain conditions. The algorithm implements an efficient resource allocation method and a variance reduction technique to reduce the overall computational burden. The experimental results show that the techniques to reduce the computational time are effective and can significantly reduce the amount of simulations required for the fitness evaluation. If a candidate schedule is allocated insufficient simulation replications it can lead to an inaccurate estimate of its long-term average performance. This could lead to an average performance loss of 7.3 %. Furthermore, the proactive scheduler is able to generate schedules that are more robust compared to deterministically generated. A reduction in the average operational cost of about 5 % can be reached, compared to a deterministically generated schedule. The paper reveals the relevance of identifying and modeling uncertainty when designing schedules in an operational system, rather than looking for optimal schedules for ideal scenarios.
Keywords:
Metaheuristics
Robotic mobile fulfillment system
Scheduling and routing
Evolutionary algorithm
Stochastic optimization
E-commerce