PARTICLE SWARM OPTIMIZATION ALGORITHM FOR THE PREPACK OPTIMIZATION PROBLEM

Packing problem is one of the most well-known problems in inventory control situations. There are some methods for solving such problems one of which is the meta-heuristic algorithm. The PSO method is a procedure that solves problems with a heuristic procedure. In this study, some realistic assumptions are considered and each particle has its speed. Then, these particles transfer in the solution space, and after every iteration, fitness function for each particle is calculated. We intend to solve the packaging problem by using PSO in this investigation. It is considered that the operable cost in this problem is considerable. In this case, we have the instance of the warehouse that should manage a wide range of various shops, requiring a given group of items. Consequently, this paper is solved a Mixed-integer linear programming problem for the pre-pack optimization problem and results shows the presented method could reduce the optimal amount in reasonable time effort.