Abstract It is a common operation mode of shuttle-based storage and retrieval systems (SBS/RS) to combine storage and outbound tasks to form a compound operation. Optimizing a reasonable compound operation path is of great significance for improving operation efficiency and reducing operation costs. In order to improve the order picking efficiency of SBS/RSs, the optimization of the system's compound operation path is attributed to a task assignment problem, and an optimization model is established with the goal of minimizing the total time to complete a batch of tasks. An improved discrete particle swarm optimization (IDPSO) algorithm is designed. The position and velocity of particles and the equation of motion are redefined. Cycle crossover and exchange mutation are introduced into the addition of velocity to achieve fast convergence of the algorithm, while maintaining the diversity of the particle swarm through a repulsion operator, reducing the possibility of falling into a local optimum. The simulation results show that the performance of the algorithm is better than genetic algorithm, which effectively shortens the time of compound operations and improves the picking efficiency.
WANG Shanshan,ZHANG Jihui. Routing Optimization of Compound Operations in Shuttle-Based Storage and Retrieval Systems[J]. Complex Systems and Complexity Science,
2021, 18(1): 63-72.
