A New PSO-based Algorithm for Two-Dimensional Non-Guillotine Non-Oriented Cutting Stock Problem

ABSTRACT In this paper, a new algorithm is proposed for the two-dimensional non-guillotine non-oriented cutting stock problem. The considered problem consists of cutting small rectangular pieces of predetermined sizes from large but finite rectangular plates. The objective is to generate cutting patterns that minimize the unused area and fulfill customer orders. The proposed algorithm is a combination of a new particle swarm optimization approach with a heuristic criterion inspired from the literature. The algorithm is tested on twenty-two instances divided into two sets. Corresponding results show the algorithm efficiency in optimizing the trim loss that is comprised between 2.6% and 7.8% for all considered instances.

[1]  K. Lai,et al.  Developing a simulated annealing algorithm for the cutting stock problem , 1997 .

[2]  Maher Barkallah,et al.  An adapted particle swarm optimization approach for a 2D guillotine cutting stock problem , 2016 .

[3]  John E. Beasley.  A population heuristic for constrained two-dimensional non-guillotine cutting , 2004, Eur. J. Oper. Res..

[4]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[5]  Ramón Alvarez-Valdés,et al.  A tabu search algorithm for a two-dimensional non-guillotine cutting problem , 2007, Eur. J. Oper. Res..

[6]  Marco A. Boschetti,et al.  New upper bounds for the two‐dimensional orthogonal non‐guillotine cutting stock problem , 2002 .

[7]  R. W. Haessler,et al.  Cutting stock problems and solution procedures , 1991 .

[8]  Reinaldo Morabito,et al.  Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach , 1996 .

[9]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[10]  G Y.-G.,et al.  A new upper bound for unconstrained two-dimensional cutting and packing , 2002, J. Oper. Res. Soc..

[11]  G. Bozis,et al.  A new formulation of the two-dimensional inverse problem of dynamics , 1998 .

[12]  Naoufel Cheikhrouhou,et al.  A hybrid heuristic to solve the two dimensional cutting stock problem with consideration of forecasts , 2009, 2009 International Conference on Computers & Industrial Engineering.

[13]  Chengbin Chu,et al.  Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems , 1999, Oper. Res..

[14]  Gleb Belov.  Problems, Models and Algorithms in One- and Two-Dimensional Cutting , 2003 .

[15]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[16]  Daniele Vigo,et al.  Two‐Dimensional Bin Packing Problems , 2014 .

[17]  Aziz Moukrim,et al.  New resolution algorithm and pretreatments for the two-dimensional bin-packing problem , 2008, Comput. Oper. Res..

[18]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[19]  Attahiru Sule Alfa,et al.  A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem , 1994 .

[20]  Daniele Vigo,et al.  5. Two-Dimensional Bin Packing Problems , 2013 .

[21]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[22]  Bengt-Erik Bengtsson,et al.  Packing Rectangular Pieces - A Heuristic Approach , 1982, Comput. J..

[23]  Saoussen Krichen,et al.  Particle swarm optimization approach for resolving the cutting stock problem , 2014, 2014 International Conference on Advanced Logistics and Transport (ICALT).