An improved crossover particle swarm optimization algorithm for automatic order sorting in distribution center

Abstract

In this paper, the automatic order sorting problem with scattered storage is studied. First, the mathematical model of the problem is established. Then an improved crossover particle swarm optimization (CPSO) algorithm is proposed for order batching, batch sequencing and storage selection. The CPSO mainly conducts the position update of particle swarm optimization algorithm by using crossover, which makes it more suitable for discrete problems. In order to enhance the local search capability of the algorithm, a variable neighborhood search (VNS) algorithm is proposed. And the neighborhood structure of the automatic order sorting problem for scattered storage is defined. The VNS will further search the neighborhood of the global optimal solution after each operation of the CPSO position update. Finally, the effectiveness of the proposed CPSO is verified by numerical experiments.