Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

Abstract In this paper a pure meta-heuristic (genetic algorithm) and a mixed meta-heuristic (simulated annealing-genetic algorithm) were applied to two-dimensional orthogonal packing problems and the results were compared. The major motivation for applying a modified genetic algorithm is as an attempt to alleviate the problem of pre-mature convergence. We found that in the long run, the mixed heuristic produces better results; while the pure heuristic produces only “good” results, but produces them faster.

[1]  Pinaki Mazumder,et al.  Genetic Algorithms for VLSI Design, Layout and Test Automation , 1998 .

[2]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[3]  W. Ebeling,et al.  Boltzmann and Darwin strategies in complex optimization , 1987 .

[4]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[5]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[6]  Bruce E. Rosen,et al.  Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .

[7]  K. Dowsland.  Some experiments with simulated annealing techniques for packing problems , 1993 .

[8]  David E. Goldberg,et al.  Parallel Recombinative Simulated Annealing: A Genetic Algorithm , 1995, Parallel Comput..

[9]  Kathryn A. Dowsland,et al.  Genetic Algorithms-a Tool for OR? , 1996 .

[10]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998 .

[11]  Gary J. Koehler,et al.  New directions in genetic algorithm theory , 1997, Ann. Oper. Res..

[12]  Shu-Yuen Hwang,et al.  A Genetic Algorithm with Disruptive Selection , 1993, ICGA.

[13]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms in Engineering Applications , 1997, Springer Berlin Heidelberg.

[14]  Nicos Christofides,et al.  An exact algorithm for general, orthogonal, two-dimensional knapsack problems , 1995 .

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Dirk Thierens,et al.  Elitist recombination: an integrated selection recombination GA , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[18]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[19]  Way Kuo,et al.  THREE DIMENSIONAL PALLETIZATION OF MIXED BOX SIZES , 1993 .

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

[21]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

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

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

[24]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[25]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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