摘要

The Cutting stock problem is an important problem that arises in a variety of industrial applications. The problem includes a grouping phase (the grouping problem). This research adopts a novel grouping particle swarm optimization approach for grouping problem. In this article, new particle position and velocity updating equations are developed according to the structure of grouping problem for cutting stock problem. The approach works with groups of items instead of items exclusively, compared with conventional method for cutting stock problem. The proposed approach is tested on a set of real instances from the ship building industry with very good results. Moreover, the efficacy and efficiency of the proposed approach are indicated on a set of randomly generated instances.