Carousel Path Optimization Based on Hybrid Particle Swarm Optimization Algorithm

In order to improve the efficiency of rotating shelf scheduling, the optimal picking path optimization problem with time interval constraint (MCS-OOIP) is considered, the mathematical model of MCS-OOIP is established, and an improved hybrid particle swarm optimization algorithm is proposed., By introducing the crossover strategy and mutation strategy of genetic algorithm and the acceptance criterion of simulated annealing algorithm, a hybrid particle swarm optimization algorithm for solving MCS-OOIP problem is constructed by combining it with particle swarm optimization algorithm. The simulation results are compared with the simple genetic algorithm, which shows that the algorithm can more effectively solve the MCS-OOIP problem under the single rotating shelf. The research results can be used as a reference for the transportation path optimization of rotary storage system.