A REVIEW: META- HEURISTIC APPROACHES FOR SOLVING RECTANGLE PACKING PROBLEM

Packing problems are optimization problem encountered in many areas of business and industries and have wide applications. These problems look for good arrangement of multiple items in some larger containing regions with an objective to maximize the utilization of resource materials. 2D packing problem has wide industrial applications starting from small scale industries related to leather, furniture, glass, metal, and wood to large scale industries dealing with textile, garments, paper, shipbuilding, automobiles and VLSI design. In this paper authors have summarized the different Metaheuristic approaches used to solve packing problem. Accordingly, this paper is a pure academic activity that catalogues latest research in the area of Rectangle packing Problem using Metaheuristic approaches.

[1]  S. Jakobs,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .

[2]  Renbin Xiao,et al.  Ant Colony Algorithm for the Weighted Item Layout Optimization Problem , 2010, ArXiv.

[3]  Frederick Ducatelle.  Ant Colony Optimisation for Bin Packing and Cutting Stock Problems , 2001 .

[4]  Manuel Iori,et al.  A hybrid genetic algorithm for the two-dimensional single large object placement problem , 2007, Eur. J. Oper. Res..

[5]  Qingfu Zhang,et al.  Combination of Guided Local Search and Estimation of Distribution Algorithm for Quadratic Assignment Problems , 2006 .

[6]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[7]  Zafer Bingul,et al.  Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems , 2006, Eng. Appl. Artif. Intell..

[8]  E. Hopper,et al.  Application of Genetic Algorithms to Packing Problems — A Review , 1998 .

[9]  H. Gea,et al.  Two-dimensional packing problems using genetic algorithms , 2005, Engineering with Computers.

[10]  Cihan H. Dagli,et al.  New approaches to nesting rectangular patterns , 1997, J. Intell. Manuf..

[11]  Derek Smith,et al.  Bin Packing with Adaptive Search , 1985, ICGA.

[12]  Loris Faina,et al.  An application of simulated annealing to the cutting stock problem , 1999, Eur. J. Oper. Res..

[13]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[14]  Ben Mohamed Ahemed Mohamed,et al.  Optimization by Ant Colony Hybryde for the Bin-Packing Problem , 2009 .

[15]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[16]  Cheng-Yan Kao,et al.  On solving rectangle bin packing problems using genetic algorithms , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[17]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[18]  Kathryn A. Dowsland,et al.  A family of genetic algorithms for the pallet loading problem , 1996, Ann. Oper. Res..

[19]  Jagdev Singh,et al.  DESIGN & DEVELOPMENT OF GENETIC ALGORITHMS FOR ECONOMIC LOAD DISPATCH OF THERMAL GENERATING UNITS , 2012 .

[20]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[21]  Daniele Vigo,et al.  Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..

[22]  Kawaljeet Singh,et al.  Experimenting Genetic Approach to Extend Rectangular Packing Heuristic Solution , 2010 .

[23]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

[24]  K.K.B. Hon,et al.  The Nesting of Two-Dimensional Shapes Using Genetic Algorithms , 1995 .

[25]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[26]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[27]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[28]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[29]  Thomas Stützle,et al.  A beginner's introduction to iterated local search , 2001 .

[30]  Frederick Ducatelle,et al.  Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..

[31]  Sudip Kumar Sahana.  A COMPARATIVE STUDY ON MULTICAST ROUTING USING DIJKSTRA’S, PRIMS AND ANT COLONY SYSTEMS , 2011 .

[32]  S. Imahori,et al.  Improved local search algorithms for the rectangle packing problem with general spatial costs , 2004, Eur. J. Oper. Res..

[33]  A. Ramesh Babu,et al.  A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms , 2001, Comput. Aided Des..

[34]  José Fernando Gonçalves,et al.  A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem , 2007, Eur. J. Oper. Res..

[36]  Chang-Chun Lin,et al.  A genetic algorithm for solving the two-dimensional assortment problem , 2006, Comput. Ind. Eng..

[37]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[38]  Oliver Vornberger,et al.  Parallel Genetic Packing of Rectangles , 1990, PPSN.

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

[40]  Daniele Vigo,et al.  Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem , 1999 .

[41]  Graham Kendall,et al.  Comparison of meta-heuristic algorithms for clustering rectangles , 1999 .

[42]  B. Kröger.  Guillotineable bin packing: A genetic approach , 1995 .

[43]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[44]  Yang Qi,et al.  The Particle Swarm Optimization Algorithm for Solving Rectangular Packing Problem , 2011 .

[45]  Godfrey C. Onwubolu,et al.  A genetic algorithm approach for the cutting stock problem , 2003, J. Intell. Manuf..

[46]  Andreas T. Ernst,et al.  Strip packing with hybrid ACO: Placement order is learnable , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[47]  Marvin D. Troutt,et al.  Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem , 2003, Eur. J. Oper. Res..

[48]  Duanbing Chen,et al.  A new heuristic algorithm for rectangle packing , 2007, Comput. Oper. Res..

[49]  S. Kanimozhi Suguna,et al.  Comparative Analysis of Bee-Ant Colony Optimized Routing (BACOR) with Existing Routing Protocols for Scalable Mobile Ad Hoc Networks (MANETs) based on Pause Time , 2012 .

[50]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[51]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[52]  Z. Michalewicz,et al.  A genetic algorithm for the linear transportation problem , 1991, IEEE Trans. Syst. Man Cybern..

[53]  A. A. Lipnitskii.  Use of Genetic Algorithms for Solution of the Rectangle Packing Problem , 2002 .