Fast Simulation-Based Order Sequence Optimization Assisted by Pre-Trained Bayesian Recurrent Neural Network

Abstract

This paper presents a fast optimization method for the picking order sequence of automated order picking systems in logistics warehouses. In this order sequencing problem (OSP), the fulfillment sequence of the given picking order set is determined to optimize the performance measures such as makespan and deadlock occurrence. Simulation is generally necessary to evaluate these measures for complex automated systems. However, their order sequence cannot be optimized quickly due to the long calculation time. It may make the system productivity and flexibility lower than expected because its picking schedules cannot be updated frequently. We, therefore, propose a fast optimization method to solve these simulation-based OSPs by taking a pretrained surrogate-assisted optimization approach. Firstly, we utilized a Bayesian recurrent neural network (BRNN) as a surrogate model to accurately learn the relationship between picking order sequence and performances. Secondly, we developed the surrogate-assisted optimization method based on simulated annealing (SA) and BRNN. Numerical experiments show that the surrogate model can evaluate about 10000 times faster than the simulation. The proposed method also obtains an optimized solution 8.9 times faster than simulation-based optimization by the original SA.