A new heuristic algorithm for rectangle packing

Computers and Operations Research

Volumn 34, Issue 11, 2007, Pages 3270-3280

  Huang, Wenqi ^a   Chen, Duanbing ^a   Xu, Ruchu ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Caving degree; Corner occupying action; Heuristic algorithm; Rectangle packing

Indexed keywords

CUTTING; PACKING; PROBLEM SOLVING;

CAVING DEGREES; RECTANGLE PACKING;

HEURISTIC ALGORITHMS;

CUTTING; PACKING; PROBLEM SOLVING;

EID: 34047116778     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.12.005     Document Type: Article

References (20)

1. Hopper E., and Turton B. A genetic algorithm for a 2D industrial packing problem. Computers and Industrial Engineering 37 (1999) 375-378
2. Hopper E., and Turton B. An empirical investigation of meta-heuristic and heuristic algorithm for a 2D packing problem. European Journal of Operational Research 128 (2001) 34-57
3. Guo PN, Cheng CK, Yoshimura T. An O-tree representation of non-slicing floorplans and its applications. In: DAC, 1999. p. 268-73.
4. Pang Y, Cheng CK, Yoshimura T. An enhanced perturbing algorithm for floorplan design using the O-tree representation. ISPD 2000; 168-73.
5. Chang YC, Chang Y-W, Wu GM, Wu SW. B*-tree: a new representation for non-slicing floorplans. In: DAC, 2000. p. 458-63.
6. Murata H., Fujiyoshi K., Nakatake S., and Kajitani Y. VLSI module placement based on rectangle-packing by the sequence pair. IEEE Transactions on Computer Aided Design 15 (1996) 1518-1524
7. Tang X, Wong DF, FAST-SP: a fast algorithm for block placement based on sequence pair, ASP-DAC 2001; 521-6.
8. Pisinger D. Denser placements in VLSI design obtained in O (n log log n) time. INFORMS Journal on Computing 2005, in press.
9. Nakatake S, Murata H, Fujiyoshi H, Kajitani Y. Module placement on BSG-structure and IC layout application. In: Proceedings of International Conference on Computer Aided Design, 1996. p. 484-90.
10. Hong XL, et al. Corner block list: an effective and efficient topological representation of non-slicing floorplan. In: IEEE, 2000, p. 8-12.
11. Ma YC, et al. Stairway compaction using corner block list and its applications with rectilinear blocks. Proceedings of the 15th International Conference on VLSI Design 2002.
12. Lin J-M, Chang Y-W. TCG: a transitive closure graph-based representation for non-slicing floorplans. In: DAC 2001. p. 764-9.
13. Lin J-M, Chang Y-W. TCG-S: orthogonal coupling of P*-admissible representations for general floorplans. In: DAC 2002. p. 842-7.
14. Lin J-M, Chang Y-W, Lin S-P. Corner sequence-a P-admissible floorplan representation with a worst case linear-time packing scheme. IEEE Trans on Very Large Scale Integration Systems 2003. p. 679-86.
15. Wu Y.-L., Huang W.Q., Lau S., Wong C.-K., and Young G.H. An effective quasi-human based heuristic for solving the rectangle packing problem. European Journal of Operational Research 141 (2002) 341-358
16. Huang W.Q., and Jin R.C. The quasi-physical and quasi-sociological algorithm solar for solving SAT problem. Science in China, Series E (Technological Sciences) 27 2 (1997) 179-186
17. Huang W.Q., and Xu R.C. Two personification strategies for solving circles packing problem. Science in China, Series E (Technological Sciences) 42 6 (1999) 595-602
18. 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
19. Pisinger D., and Sigurd M.M. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization 2 (2005) 154-167
20. Fekete SP, Schepers J. An exact algorithm for higher-dimensional orthogonal packing. Operations Research, in press.