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

European Journal of Operational Research

Volumn 145, Issue 3, 2003, Pages 530-542

  Leung, T W ^a   Chan, Chi Kin ^b   Troutt, Marvin D ^c  

^a Diocesan Girls' School   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c KENT STATE UNIVERSITY   (United States)

Author keywords

Difference process strategy; Genetic algorithm; Meta heuristics; Mixed heuristics; Simulated annealing; Two dimensional orthogonal packing problem

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; SIMULATED ANNEALING;

MIXED HEURISTICS;

OPERATIONS RESEARCH;

EID: 0037448817     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00218-7     Document Type: Article

References (29)

1. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research. 33:1985;49-64.
2. Boseniuk T., Ebeling W., Engel A. Boltzmann and Darwin strategies in complex optimization. Physics Letters A. 125:1987;307-310.
3. Chan C.K., Cheung B.K.S., Langevin A. A modified genetic algorithm for the joint replenishment problem. Proceedings of the 3rd International Conference in Industrial Engineering, Montreal, Canada. 1999;1281-1289.
4. Christofides N. An exact algorithm for general, orthogonal two-dimensional knapsack problems. European Journal of Operational Research. 83:1995;39-56.
5. Dasgupta D., Michalewicz Z. Evolutionary Algorithms in Engineering Applications. 1997;Springer, Berlin.
6. Dowsland K.A. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research. 68:1993;389-399.
7. Dowsland K.A. Genetic algorithms - a tool for OR? Journal of the Operational Research Society. 47:1996;550-561.
8. Glover F., Kelly J.P., Laguna M. Genetic algorithms and tabu search: Hybrids for optimization. Computers and Operations Research. 22(1):1995;111-134.
9. Goldberg D.E. Genetic Algorithms. 1989;Addison-Wesley, Reading, MA.
10. Holland J. Adaptation in Natural and Artificial Systems. 1975;Michigan Press, Michigan.
11. Hopper E., Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research. 128:2000;34-57.
12. Ingber L. Genetic algorithms and very fast simulated reannealing: A comparison. Mathematical and Computer Modelling. 16(11):1992;87-100.
13. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research. 88:1996;165-181.
14. Kirpatrick S., Gelatt C.D., Vecchi P.M. Optimization by simulated annealing. Science. 220:1983;671-680.
15. Koehler G.J. New directions in genetic algorithm theory. Annals of Operations Research. 75:1997;49-68.
16. Kuo T., Hwang S.Y. A genetic algorithm with disruptive selection. IEEE Transactions on Neural Networks. 26(2):1996;299-307.
17. Lai K.K., Chan W.M. Developing a simulated annealing algorithm for the cutting stock problem. Computers and Industrial Engineering. 32(1):1997;115-127.
18. Leung, T.W., Chan, C.K., Troutt, M., 2000. Comparison of meta-heuristics for the two dimensional orthogonal packing problem. Working Paper, Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong.
19. Lin F.T., Kao C.Y., Hsu C.C. Applying the genetic approach to simulated annealing in solving some NP-hard problems. IEEE Transactions on Systems, Man, and Cybernetics. 23(6):1993;1752-1767.
20. Mahfoud S.W., Goldberg D.E. Parallel recombinative simulated annealing: A genetic algorithm. Parallel Computing. 21:1995;1-28.
21. Mazumder P., Rudnick E.M. Genetic Algorithms for VLSI Design, Layout and Test Automation. 1999;Prentice-Hall, Englewood Cliffs, NJ.
22. Metropolis N., Rosenbluth A.N., Rosenbluth M.N., Teller A.H., Teller H. Equations of state calculation by fast computing machines. The Journal of Chemical Physics. 21:1953;1087-1091.
23. Osman I.H., Laporte G. Metaheuristics: A bibliography. Annals of Operations Research. 63:1996;513-623.
24. Parada V., Sepulveda M., Solar M., Gomes A. Solution for constrained guillotine cutting problem by simulated annealing. Computers and Operations Research. 25(1):1998;37-47.
25. Rudolph G. Convergence properties of canonical genetic algorithms. IEEE Transactions on Neural Networks. 5(1):1994;96-101.
26. Tsai R.D. Three dimensional palletization of mixed box sizes. IIE Transactions. 25:1993;64-75.
27. Thierens, D., Goldberg, D.E., 1994. Elitist recombination: An integrated selection recombination GA. In: Proceedings of the First IEEE Conference on Evolutionary Computation ICEC'94.
28. Wang L., Zheng D.Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research. 28:2001;585-596.
29. Wolpert D.H., Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation. 1(1):1997;67-82.