Experiments with a strategic oscillation algorithm for the pallet loading problem

International Journal of Production Research

Volumn 39, Issue 11, 2001, Pages 2341-2351

  Amaral, André R S ^a   Wright, Mike ^b  

^a FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LOADING; OPTIMIZATION; PALLETS;

PALLET LOADING PROBLEM; STRATEGIC OSCILLATION;

OPERATIONS RESEARCH;

EID: 0035920337     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540110044589     Document Type: Article

References (22)

1. Bortfeldt, A., 1994, A genetic algorithm for the container loading problem. Proceedings of the Conference on Adaptive Computing and Information Processing, Brunel Conference Centre, Vol. 2.
2. Cook, F. D. and Wolfe, M. L., 1991, Genetic algorithm approach to a lumber cutting optimization problem. Cybernetics and Systems: An International Journal, 22, 357-365.
3. Dowsland, K. A., 1984, The three-dimensional pallet chart: an analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. Journal of Operational Research Society, 35, 895-905
4. Dowsland, K. A., 1987, An exact algorithm for the pallet loading problem. European Journal of Operational Research, 31. 78-84
5. Dowsland, K. A., 1998, Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393-407.
6. Georgis, N., Petrou, M. and Kittler, J., 1992, A new algorithm for the constrained rectangle packing problem. Second International Conference on Automation, Robotics and Computer Vision, vol. 2, Singapore, 16-18 September 1992, IA4.1.1-IA4.1.5.
7. Glover, F. and Kochenberger, G., 1996, Critical event tabu search for multidimensional knapsack problems. Metaheuristics: Theory & Applications, edited by I. H. Osman and J. P. Kelly (Kluwer Academic Publishers), pp. 407-417.
8. Glover, F. and Laguna, M., 1997, Tabu Search (Kluwer Academic Publishers).
9. Heistermann, J. and Lengauer, T., 1995, The nesting problem in the leather manufacturing industry. Annals of Operations Research, 57, 147-173.
10. Hower, W., 1994, Evolutionary techniques in an OR related packing and layout configuration problem, Technical Report, Koblenz University.
11. Jain, P., Fenyes, P. and Richter, R., 1992, Optimal blank nesting using simulated annealing. Transactions of the ASME, 114, 160-165.
12. Jakobs, S., 1996, On genetic algorithm for the packing of polygons. European Journal of Operational Research, 88, 165-181.
13. Juliff, K., 1993, A Multi-chromosome genetic algorithm for pallet loading. Proceedings of the 5th International Conference on Genetic Algorithms (Morgan Kaufmann), pp. 467-473.
14. Kawakami, T., Minagawa, M. and Kakazu, Y., 1991, Auto tuning of 3-D packing rules using genetic algorithm. IEEE/RSJ International Workshop on Intelligent Robots and Systems, IROS'91.
15. Koakutsu, S., Sugai, Y. and Hirata, H., 1992, Block placement by improved simulated annealing based on genetic algorithm. Lectures Notes in Control and Information Sciences, 180, 648-656.
16. Lin, J. L., Foot, B., Pulat, S., Chang, C. H. and Cheung, J. Y., 1993, Hybrid genetic algorithm for container packing in three dimensions. Proceedings of the 9th IEEE Conference on Artificial Intelligence (Washington DC: IEEE Computer Society Press), pp. 353-358.
17. Lutfiyya, H., McMillian, B., Poshyanonda, P. and Dagli, C., 1992, Composite stock cutting through simulated annealing. Mathematical and Computer Modelling, 16, 57-74.
18. Marques, V. M. M., Bispo, C. F. G. and Sentieiro, J. J. S., 1991, A system for the compactation of two-dimensional irregular shapes based on simulated annealing. Proceedings of the 17th Annual Conference of the IEEE Industrial Electronics Society, pp. 1911-1915.
19. Nelissen, J., 1993, New approaches to the pallet loading problem. Working Paper, RWTH Aachen (available via anonymous ftp from ftp.informatik.rwth-aachen.de (137.226.225.3) as /pub/reports/pallets.ps.Z)
20. Nelissen J., 1995, How to use structural constraints to compute an upper bound for the pallet loading problem. European Journal of Operational Research, 84, 662-680.
21. Petridis, V. and Kazarlis, S., 1994, Varying quality function in genetic algorithms and the cutting problem. IEEE World Conference on Computational Intelligence.
22. Prosser, P., 1988, A hybrid genetic algorithm for pallet loading. Procedures of the 8th European Conference on Artificial Intelligence (London: Pitman), pp. 159-164.