Multiple-objective genetic optimization of the spatial design for packing and distribution carton boxes

Computers and Industrial Engineering

Volumn 54, Issue 4, 2008, Pages 889-902

  Leung, S Y S ^a   Wong, W K ^a   Mok, P Y ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Clustering technique; Container design; Multi objective genetic algorithms; Packing and cutting

Indexed keywords

CLUSTERING ALGORITHMS; COST REDUCTION; GENETIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION;

CLUSTERING TECHNIQUES; CONTAINER DESIGN;

INDUSTRIAL ENGINEERING;

EID: 41449107916     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.10.018     Document Type: Article

References (35)

1. Beasley J.E. An algorithm for the two-dimensional assortment problem. European Journal of Operational Research 19 (1985) 253-261
2. Bischoff E.E., Janetz F., and Ratcliff M.S.W. Loading pallets with non-identical items. European Journal of Operational Research 84 (1995) 681-692
3. Bortfeldt A., and Gehring H. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131 (2001) 143-161
4. Chen C.S., Lee S.M., and Shen Q.S. An analytical model for the container loading problem. European Journal of Operational Research 80 (1995) 68-76
5. Coello C.A.C., Van Veldhuizen D.A., and Lamont G. Evolutionary algorithms for solving multi-objective problems (2002), Kluwer Academic Publishers, Boston, MA
6. De Jong K.A. An analysis of the behavior of a class of genetic adaptive systems. Doctoral dissertation (1975), University of Michigan, Ann Arbor
7. Deb K. Multi-objective optimization using evolutionary algorithms (2001), Wiley, Chichester, UK
8. Deb K., Agrawal S., Pratap A., and Meyarivan T. A fast and elitist multiobjective genetic algorithms: NSGA-II. IEEE Transactions on Evolutionary Computation 6 2 (2002) 182-197
9. Deb, K., Mohan, M., & Mishra, S. (2003). A fast multi-objective evolutionary algorithm for finding well-spread pareto-optimal solutions. Kanpur Genetic Algorithms Laboratory Report 2003002, Indian Institute of Technology, Kanpur, India.
10. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-160
11. Dyckhoff H., Scheithauer G., and Terno J. Cutting and packing. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated bibliographies in combinatorial optimization (1997), Wiley, Chichester 393-412
12. Fonseca, C. M. & Fleming, P. J. (1993). Genetic algorithms for multiobjective optimization: formulation, discussion, and generalization, Proceedings of the fifth international conference on genetic algorithms (pp. 416-423).
13. Gehring H., and Bortfeldt A. A genetic algorithm for solving the container loading problem. International Transactions on Operational Research 4 5-6 (1997) 401-418
14. Gehring M., Menscher K., and Meyer M. A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research 44 (1990) 277-288
15. George J.A., and Robinson D.F. A heuristic for packing boxes into a container. Computers and Operations Research 7 (1980) 147-156
16. Gilmore P.C., and Gomory R.E. Multistage cutting stock problems of two and more dimensions. Operations Research 13 (1965) 94-120
17. Goldberg, D. E., & Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Grefenstette, Genetic algorithms and their applications ICGA'87 (pp. 41-49).
18. Goldberg D.E. Genetic algorithms in search, optimisation, and machine learning (1989), Addison-Wesley
19. Hodgson T.J. A combined approach to the pallet loading problem. IIE Transactions 14 3 (1982) 175-182
20. Holland J.H. Adaptation in natural and artificial systems (1975), MIT Press
21. Ishibuchi H., and Murata T. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews 28 3 (1998) 392-403
22. Knowles J.E., and Corne D.W. Approximating the non-dominated front using the Pareto archived evolution strategy. Evolutionary Computation Journal 8 2 (2000) 149-172
23. Kursawe F. A variant of evolution strategies for vector optimization. In: Schwefel H.P., and Männer R. (Eds). Parallel problem solving from nature (1991), Springer-Verlag, Berlin, Germany 193-197
24. Li H.L., and Chang C.T. An approximately global optimization method for assortment problems. European Journal of Operational Research 105 (1998) 604-612
25. Mack D., Bortfeldt A., and Gehring H. A parallel hybrid local search algorithm for the container loading problem. International Transactions in Operational Research 11 5 (2004) 511-534
26. MacQueen, J. B. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth berkeley symposium on mathematical statistics and probability, (Vol. 1, pp. 281-297). Berkeley, CA: University of California Press.
27. Morabito R., and Arenales M. An AND/OR-graph approach to the container loading problem. International Transactions in Operational Research 1 1 (1994) 59-73
28. Ngoi B.K.A., Tay M.L., and Chua E.S. Applying spatial representation techniques to the container packing problem. International Journal of Production Research 32 (1994) 111-123
29. Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Operations Research 45 (1997) 758-767
30. Pisinger D. Heuristics for the container loading problem. European Journal of Operational Research 141 (2002) 382-392
31. Schaffer, J. D. (1985). Multi-objective optimization with vector evaluated genetic algorithms. In Proceedings of the first international conference on genetic algorithms (pp. 93-100).
32. Scheithauer G. Algorithms for the container loading problem. Operational research proceedings 1991 (1992), Springer, Berlin
33. Scheithauer G. LP-based bounds for the container and multi-container loading problem. International Transactions in Operational Research 6 (1999) 199-213
34. Terno J., Scheithauer G., Sommerweiß U., and Riehme J. An efficient approach for the multi-pallet loading problem. European Journal of Operational Research 123 (2000) 372-381
35. Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3 4 (1999) 257-271