Solving the Rectangular Packing Problem of the Discrete Particle Swarm Algorithm

The problem of rectangular packing in the two-dimensional cutting issues is studied in this paper. Because packing problem can be provided through the nesting rules (the remainder rectangular packing rule) into combinatorial optimization problem, a Discrete Particle Swarm Optimization Algorithm (DPSO) is proposed according to the characteristics of optimize the combination of discrete issues. In this DPSO algorithm, the location, speed and computing rules of the particle are redefined in order to find the optimize result in the search of the discrete solution space. The obtained results are better than the results published in the literature.