A survey of various encoding schemes and associated placement algorithms applied to packing and layout problems

Proceedings of the ASME Design Engineering Technical Conference

Volumn 2006, Issue , 2006, Pages

  Tiwari, Santosh ^a   Fadel, Georges ^a   Gantovnik, Vladimir ^a  

^a AMRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; TECHNOLOGICAL FORECASTING;

PACKING PROBLEMS; PLACEMENT ALGORITHMS;

ENCODING (SYMBOLS);

EID: 33751375520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1115/detc2006-99271     Document Type: Conference Paper

References (40)

1. Grignon, P., and Fadel, G. M., 2004. "A GA based configuration design optimization method". ASME Journal of Mechanical Design, 126(1), pp. 6-15.
2. 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.
3. Zhang, L., and Kleine, U., 2003. "A novel bottom-left packing genetic algorithm for analog module placement". Advances in Radio Sciences, pp. 191-196.
4. 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.
5. 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.
6. Deb, K., Jain, P., Gupta, N. K., and Maji, H. K., 2004. "Multiobjective placement of electronic components using evolutionary algorithms". IEEE Transactions on Components and Packaging Technologies, 27(3), pp. 480-492.
7. 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.
8. Ono, T., and Ikeda, T., 1998. "Optimizing two-dimensional guillotine cut by genetic algorithms". SLAM Journal of Optimization, 8(3), pp. 631-657.
9. Burke, E. K., Kendell, G., and Whitwell, G., 2004. "A new placement heuristic for the ortogonal stock-cutting problem". Operations Research, 52(4), pp. 655-671.
10. Scheithauer, G., and Sommerweib, U., 1996. 4-block heuristic for the rectangle packing problem. Tech. rep., Institute of Numerical Mathematics, Technical University, Dresden.
11. Martello, S., Pisinger, D., and Vigo, D., 2000. "The three-dimensional bin packing problem". Operations Research, 48(2), pp. 256-267.
12. Miao, Y., 2005. "Packing optimization of engineering problems". PhD thesis, Clemson University.
13. Wodziak, J. R., and Fadel, G. M., 1994. "Packing and optimizing the center of gravity location using a genetic algorithm". Journal of Computers in Industry.
14. Azadivar, F., and Wang, J., 2000. "Facility layout optimization using simulation and genetic algorithms". Interntational Journal of Production Research, 38(17), pp. 4369-4383(15).
15. Balakrishnan, J., Cheng, C. H., and Wong, K. F., 2003. "Facopt: A user friendly facility layout optimization system". Computers and Operations Research, 30(11), pp. 1625-1641(17).
16. Shaookar, K., and Mazumder, P., 1991. "VLSI cell placement techniques". ACM Computing Surveys (CSUR), 23(2), pp. 143-220.
17. Raidl, G. R., and Kodydek, G., 1998. "Genetic algorithms for the multiple container packing problem". In Lecture Notes in Computer Science, Vol. 1498, Springer-Verlag, GmbH, p. 875.
18. Chu, P. C., and Beasley, J. E., 1998. "A genetic algorithm for multidimensional knapsack problem". Journal of Heuristics, 4(1), pp. 63-86.
19. Vidyakiran, Y., Mahanty, B., and Chakraborti, N., 2005. "A genetic-algorithms-based multiobjective approach for a three-dimensional guillotine cutting problem". Materials and Manufacturing Process, 20(4), pp. 697-715.
20. Tiwari, S., and Chakraborti, N. Multi-objective optimization of a two-dimensional cutting problems using genetic algorithms. In Press, Materials Processing Technology (2006).
21. Boef, E. D., Korst, J., Martello, S., Pisinger, D., and Vigo, D., 2003. A note on robot-packable and orthogonal variants of the three-dimensional bin packing problem. Tech. Rep. 03/02, University of Copenhagen, Copenhagen.
22. Lodi, A., Martello, S., and Monaci, M., 2002. "Twodimensional packing problems: A survey". European Journal of Operational Research, 141, pp. 241-252.
23. Lodi, A., 1999. "Algorithms for two-dimensional bin packing and assignment problems". PhD thesis, University of Bologna, Italy.
24. Kroger, B., 1995. "Guillotinable bin packing: A genetic approach". European Journal of Operational Research, 84, pp. 645-661.
25. Jakobs, S., 1996. "On genetic algorithms for the packing of polygons". European Journal of Operational Research, 88, pp. 165-181.
26. Baker, B. S., Jr., E. G. C., and Rivest, R. L., 1980. "Orthogonal packing in two dimensions". SIAM Journal on Computing, 9.
27. Hopper, E., and Turton, B., 1999. "A genetic algorithm for a 2D industrial packing problem". Computers & Industrial Engineering, 37, pp. 375-378.
28. 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.
29. Adamowicz, M., and Albano, A., 1972. "A two-stage solution of the cutting stock problem". Information Processing, 71, pp. 1086-1091.
30. Adamowicz, M., and Albano, A., 1976. "Nesting two-dimensional shapes in rectangular modules". Computer Aided Design, 8.
31. Burke, E. K., Hellier, R. S. R., Kendall, G., and Whitwell, G. A new bottom-left-fill heuristic algorithm for 2D irregular packing problem. Accepted for publication in Operations Research.
32. th ACM/IEEE Design Automation Conference, pp. 268-273.
33. Pang, Y., Cheng, C.-K., Lampaert, K., and Xie, W., 2001. "Rectilinear block packing using O-tree representation". In Proceedings of the 2001 international symposium on Physical design, ACM Press New York, NY, USA, pp. 156-161.
34. Li, J., Yan, T., Yang, B., Yu, J., and Li, C., 2004. "A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive O-tree representation". In Annual ACM IEEE Design Automation Conference, ACM Press New York, NY, USA, pp. 646-651.
35. Murata, H., Fujiyoshi, K., Nakatake, S., and Kajitani, Y., 1995. "Rectangle packing based module placement". In IEEE/ACM International Conference on Computer Aided Design, pp. 472-479.
36. Oshihiko, T., and Akahashi, T., 2000. "Dropping method for rectangle packing problem". In IEEE International Symposium on Circuits and Systems, Vol. 1, pp. 200-203.
37. Akahashi, T. T., 2000. "A new encoding scheme for rectangle packing problem". In Asia and South Pacific Design Automation Conference, pp. 175-178.
38. th Design Automation Conference, pp. 268-272.
39. Stanley, R. P., 1999. Enumerative Combinatorics, Vol. 2. Cambridge University Press, pp: 219-29.
40. Miao, Y., Blouin, V, and Fadel, G. M., 2003. "Multi-objective configuration optimization with vehicle dynamics applied to midsize truck design". In Proceedings of ASME 2003 DETC.