Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

European Journal of Operational Research

Volumn 168, Issue 2 SPEC. ISS., 2006, Pages 390-402

  Dowsland, Kathryn A ^a,b   Herbert, Edward A ^c   Kendall, Graham ^a   Burke, Edmund ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b Gower Optimal Algorithms Ltd   (United Kingdom)

^c SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Branch and Bound; Cutting; Genetic Algorithms; Packing

Indexed keywords

CUTTING; HEURISTIC METHODS; INFORMATION ANALYSIS; PACKING; PROBLEM SOLVING; TREES (MATHEMATICS);

BRANCH AND BOUND; DECODERS; PACKING PROBLEMS; TREE SEARCH BOUNDS;

GENETIC ALGORITHMS;

EID: 24944469055     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.04.030     Document Type: Conference Paper

References (28)

1. M. Adomowicz, and A. Albano Nesting two-dimensional shapes in rectangular modules Computer Aided Design 8 1976 27 33
2. U. Aickelin, and K.A. Dowsland An Indirect Genetic Algorithm for a Nurse Scheduling Problem Computers and Operations Research 31 2004 761 778
3. J.E. Beasley An exact two-dimensional non-guillotine cutting tree search procedure Operations Research 1 1985 49 64
4. J.E. Beasley Bounds for two-dimensional cutting Journal of The Operational Research Society 36 1985 49 64
5. N. Christofides, and C. Whitlock An algorithm for two-dimensional cutting problems Operations Research 25 1977 30 44
6. Cotta, C., Aldana, J.F., Nebro, A.J., Troya, J.M., 1995. Hybridising genetic algorithms with branch and bound techniques for the resolution of the TSP. In: Poras, C.C., et al., (Eds.), Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, France, pp. 277-280.
7. Davis, L., 1985. Applying adaptive algorithms to epistatic domains. In: Michandani, P.B., Francis, R., (Eds.), Proceedings of the Ninth International Joint Conference on Artificial Intelligence, vol. 1, pp. 162-164.
8. Dighe, R., Jakiela, M.J., 1995. Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection. MIT Internal Report.
9. K.A. Dowsland An exact algorithm for the pallet loading problem European Journal of Operational Research 31 1987 78 84
10. Erben, W., 2000. A grouping genetic algorithm for graph colouring exam timetabling. Burke, E.K., Erben, W. (Eds.), Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT 2000), LNCS 2079, Springer, Berlin, pp. 132-156.
11. O. Faroe, D. Pisinger, and M. Zachariasen Guided local search for the three-dimensional bin packing problem INFORMS Journal on Computing 15 2003 267 283
12. E. Falkenauer Genetic Algorithms and Grouping Problems 1998 Wiley New York
13. Fekete, S.P., Schepes, J., 1997. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms - ESA '97, vol. 1284, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 144-156.
14. Fekete, S.P., Schepers, J., 2004a. An exact algorithm for higher-dimensional orthogonal packing. Technical report, Univ. of Cologne, Center for Parallel Computing, (available at http://www.math.tu-bs.de/~fekete/ publications.html ) - revised and re-submitted to Operations Research.
15. S.P. Fekete, and J. Schepers A combinatorial characterization of higher-dimensional orthogonal packing Mathematics of Operations Research 29 2004 353 368
16. F. Glover, and G. Kochenberger Handbook of Meta-heuristics 2003 Kluwer Dordrecht
17. D.E. Goldberg Genetic Algorithms in Search, Optimization and Machine Learning 1989 Addison-Wesley Reading, MA
18. E.A. Herbert, and K.A. Dowsland A family of genetic algorithms for the pallet loading problem Annals of Operations Research 63 1996 415 436
19. D. Liu, and H. Teng An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles European Journal of Operational Research 112 1999 413 420
20. A. Lodi, S. Martello, and D. Vigo Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems INFORMS Journal of Computing 11 4 1999 345 357
21. A. Lodi, S. Martello, and M. Monaci Two-Dimensional Packing Problems: A survey European Journal of Operational Research 141 2002 241 252
22. S. Martello, and P. Toth Knapsack Problems 1990 John Wiley Chichester
23. Mori, Y., Tanaka, M., 2002. A hybrid genetic algorithm for timetabling of conference programs. In: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), pp. 421-440, ISBN 90-806096-1-7.
24. A. Nagar, S.S. Heragu, and J. Haddock A meta-heuristic algorithm for a bi-criteria scheduling problem Annals of Operations Research 63 1995 397 414
25. Ozcan, E., Alkan, A., 2002. Timetabling using a steady state genetic algorithm. In: Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), pp. 104-106, ISBN 90-806096-1-7.
26. P. Pardalos, and M. Resende Handbook of Applied Optimization 2002 Oxford University Press
27. P. Prosser A hybrid genetic algorithm for pallet loading Proceedings of the Eight European Conference on Artificial Intelligence 1988 Pitman London 159 164
28. H. Tamura, A. Hirahara, I. Hatono, and M. Umano An approximate solution method for combinatorial optimisation Transactions of the Society of Instrument and Control Engineers 130 1994 329 336