The proposed research focuses on multiple-container packing problems with considerations of multiple constraints. The space utilization, stability, load bearing, and loading sequence of objects are also considered in order to make results more practicable. Clustering technology and genetic algorithm are combined to solve the proposed problems. At the beginning, clustering algorithm is applied to classify data objects into different groups with varied characteristics, such as dimension of objects, unloading sequence of objects, and capacity of containers. Then, genetic algorithm combines with heuristic rules is used to pack data objects into containers respectively. The stable packing, space utilization, unhindered unloading, and load bear limitation are the major considerations in this stage. A computer system based on the proposed algorithm was developed. Thousands of cases were simulated and analyzed to evaluate the performance of the proposed research and prove the applicability in real world. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Lin, J. L., Chang, C. H., & Yang, J. Y. (2006). A study of optimal system for multiple-constraint multiple-container packing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 1200–1210). Springer Verlag. https://doi.org/10.1007/11779568_127
Mendeley helps you to discover research relevant for your work.