A fast and efficient compact packing algorithm for free-form objects

Proceedings of the ASME Design Engineering Technical Conference

Volumn 1, Issue PARTS A AND B, 2008, Pages 543-552

  Tiwari, Santosh ^a   Fadel, Georges ^a   Fenyes, Peter ^b  

^a AMRL   (United States)

^b GENERAL MOTORS CORPORATION   (United States)

Author keywords

Collision detection; Combinatorial optimization; Compact packing; Genetic algorithm; Voxels

Indexed keywords

CAD DATA; COLLISION DETECTION; COMPACT PACKING; CONTAINER GEOMETRY; FREE-FORM OBJECT; LAYOUT ALGORITHMS; PACKING ALGORITHMS; PACKING EFFICIENCY; TRIANGULATED GEOMETRIES; VOXELS;

BENCHMARKING; COMBINATORIAL OPTIMIZATION; COMPUTER AIDED DESIGN; CONTAINERS; DATA HANDLING; ENCLOSURES; GENETIC ALGORITHMS;

ALGORITHMS;

EID: 81155138322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1115/DETC2008-50097     Document Type: Conference Paper

References (38)

1. SAE, 2005. SAE standard J1100, Motor Vehicle Dimensions.
2. DIN, 1993. Deutsches institut fur normung e. v. DIN 70020, teil 1, strabenfahrzeuge, kraftfahrzeugbau, begriffe von abmessungen.
3. Cagan, J., Shimada, K., and Yin, S., 2002. "A survey of computational approaches to three-dimensional layout problems". Computer-Aided Design, 34, pp. 597-611. (Pubitemid 34232121)
4. Lodi, A., Martello, S., and Monaci, M., 2002. "Twodimensional packing problems: A survey". European Journal of Operational Research, 141, pp. 241-252.
5. Zhang, L., and Kleine, U., 2003. "A novel bottom-left packing genetic algorithm for analog module placement". Advances in Radio Sciences, pp. 191-196.
6. Dowsland, K. A., Vaid, S., and Dowsland, W. B., 2002. "An algorithm for polygon placement using a bottom-left strategy". European Journal of Operational Research, 141, pp. 371-381. (Pubitemid 34623943)
7. Hopper, E., and Turton, B. C. H., 2001. "An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem". European Journal of Operational Research, 128, pp. 34-57. (Pubitemid 32022961)
8. Hopper, E., and Turton, B., 1999. "A genetic algorithm for a 2D industrial packing problem". Computers & Industrial Engineering, 37, pp. 375-378.
9. Liu, D., and Teng, H., 1999. "An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles". European Journal of Operational Research, 112, pp. 413-420.
10. Jakobs, S., 1996. "On genetic algorithms for the packing of polygons". European Journal of Operational Research, 88, pp. 165-181. (Pubitemid 126367100)
11. Baker, B. S., Jr., E. G. C., and Rivest, R. L., 1980. "Orthogonal packing in two dimensions". SIAM Journal on Computing, 9, pp. 846-855.
12. Martello, S., Pisinger, D., and Vigo, D., 2000. "The threedimensional bin packing problem". Operations Research, 48(2), pp. 256-267.
13. Yin, S., and Cagan, J., 2000. "An extended pattern search algorithm for three-dimensional component layout". Transactions of the ASME, 122, pp. 102-108.
14. Ding, Q., and Cagan, J. Automated trunk packing with extended pattern search. Tech. rep., SAE International. 2003-01-0671.
15. Ikonen, I., Biles, W. E., Kumar, A., Ragade, R. K., and Wissel, J. C., 1997. "A genetic algorithm for packing threedimensional non-convex objects having cavities and holes". In Proceedings of the 7th International Conference on Genetic Algorithms, pp. 591-598.
16. Eisenbrand, F., Funke, S., Reichel, J., and Schomer, E., 2003. "Packing a trunk". In Algorithms ESA 2003: 11th Annual European Symposium, Budapest, Hungary, pp. 618-629.
17. Blouin, V. Y., Fadel, G. M., Summers, J. D., and Fenyes, P. A., 2006. "Three-dimensional packing by a heuristicbased sequential genetic algorithm". In 11th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, no. AIAA 2006-6906.
18. Eisenbrand, F., Funke, S., Karrenbauer, A., Reichel, J., and Schomer, E., 2005. "Packing a trunk - now with a twist". In SPM 2005: Proceedings of the 2005 ACM Symposimum on Solid and Physical Modeling, pp. 197-206.
19. Althaus, E., Baumann, T., Schomer, E., and Werth, K., 2007. Trunk Packing Revisited, Vol. 4525 of Lecture Notes in Computer Science. Sprinter Berlin/Heidelberg, pp. 420- 432.
20. Tiwari, S., Fadel, G., and Gantovnik, V., 2006. "A survey of various encoding schemes and associated placement algorithms applied to packing and layout problems". In ASME 2006 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, no. DETC2006-99271.
21. Garey, M. R., and Johnson, D. S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
22. Mortenson, M. E., 1997. Geometric Modeling.
23. Bennell, J. A., and Song, X., 2005. A comprehensive and robust procedure for obtaining the no-fit polygon using minkowski sums. Tech. rep., University of Southampton.
24. Dawkins, R., 1976. The Selfish Gene. Oxford University Press, New York.
25. Eldredge, N., 1989. Macro-Evolutionary Dynamics: Species, Niches and Adaptive Peaks. McGraw-Hill, New York.
26. Holland, J., 1975. Adaptation in natural and artificial systems. Tech. rep., University of Michigan.
27. Goldberg, D. E., 1989. Genetic Algorithms for Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.
28. Deb, K., 2001. Multi-objective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley.
29. Coello, C. A., 1999. "A comprehensive survey of evolutionary-based multiobjective optimization techniques". Knowledge Information Systems, 1(3), pp. 269- 308.
30. Vavak, F., and Fogarty, T. C., 1996. "Comparison of steady state and generational genetic algorithms for use in nonstationary environments". In Proceedings of IEEE Conference on Evolutionary Computation, pp. 192-195.
31. Back, T., Hoffmeister, F., and Schwefel, H., 1991. "A survey of evolution strategies". In Proceedings of the 4th International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 2-9.
32. Whitley, D., 1989. "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best". In Proceedings of the Third International Conference on Genetic Algorithms, pp. 116-121.
33. Eshelman, L. J., 1991. "The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination". In Foundations of Genetic Algorithms 1 (FOGA-1), pp. 265-283.
34. Hansen, N., and Ostermeier, A., 1996. "Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaption". In Proceedings of the Third IEEE Interntational Conference on Evolutionary Computation, IEEE Press, pp. 312-317.
35. Syswerda, G. "Schedule optimization using genetic algorithms". In Handbook of Genetic Algorithms 1. New York.
36. Deb, K., and Agrawal, R. B., 1995. "Simulated binary crossover for continuous search space". Complex Systems, 9(2), pp. 115-148. (Pubitemid 126034016)
37. Deb, K., and Goyal, M., 1996. "A combined genetic adaptive search (geneas) for engineering design". Computer Science and Informatics, 26(4), pp. 30-45.
38. Yin, S., and Cagan, J., 2000. "An extended pattern search algorithm for three-dimensional component layout". Transactions of ASME, Journal of Mechanical Design, 122, pp. 102-108.