Bricklaying heuristic algorithm for the orthogonal rectangular Packing problem

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 31, Issue 3, 2008, Pages 509-515

  Zhang, De Fu ^a   Han, Shui Hua ^a   Ye, Wei Guo ^a  

^a XIAMEN UNIVERSITY   (China)

Author keywords

Bricklaying rule; Heuristic; Local search; Reference brick; The orthogonal rectangular Packing problem

Indexed keywords

MATHEMATICAL MODELS; PACKING;

BENCHMARK PROBLEM; BRICKLAYING RULE; LOCAL SEARCH; ORTHOGONAL RECTANGULAR PACKING PROBLEM; REFERENCE BRICK;

HEURISTIC ALGORITHMS;

EID: 41949097576     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/sp.j.1016.2008.00509     Document Type: Article

References (16)

1. Lodi A, Martello S, Monaci M. Two-dimensional Packing problems: A survey. European Journal of Operational Research, 2002, 141(2): 241-252
2. Hochbaum D S, Wolfgang M. Approximation schemes for covering and Packing problems in image processing and VLSI. Journal of the Association for Computing Machinery. 1985, 32(1): 130-136
3. Leung J, Tarn T, Wong C S, Gilbert Young, Francis Chin. Packing squares into square. Journal of Parallel and Distributed Computing, 1990, 10(3): 271-275
4. Huang Wen-Qi, Xu Ru-Chu. Two personification strategies for solving circles Packing problem. Science in China (Series E), 1999, 29(4): 347-353 (in Chinese)
5. Wang Jin-Min, Chen Dong-Xiang, Ma Feng-Ning, Cha Jian-Zhong. A simulated annealing Packing algorithm. Journal of Computer-Aided Design and Computer Graphics, 1998, 10(3): 253-259 (in Chinese)
6. Liu D, Teng H. An improved BL-algorithm for genetic algorithm of the orthogonal Packing of rectangles. European Journal of Operational Research, 1999, 112(2): 413-419
7. Dong She-Qin, Hong Xian-Long, Wu Yu-Liang et al. Deterministic VLSI block placement algorithm using less flexibility first principle. Journal of Computer Science and Technology, 2003, 18(6): 739-746
8. Zhang De-Fu, Huang Wen-Qi. A simulated annealing algorithm for the circles Packing problem//Proceedings of the 4th International Conference on Computational Science. Krakow, Poland, 2004: 206-214
9. Zhang De-fu, Deng An-Sheng. An effective hybrid algorithm for the problem of Packing circles into a larger containing circle. Computers and Operations Research, 2005, 32(8): 1941-1951
10. Beasley J E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 1985, 33(1): 49-64
11. Jakobs S. On genetic algorithms for the Packing of polygons. European Journal of Operational Research, 1996, 88(1): 165-181
12. Dagli C H, Poshyanonda P. New approaches to nesting rectangular patterns. Journal of Intelligent Manufacturing, 1997, 8(3): 177-190
13. Hopper E, Turton B. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D Packing problem. European Journal of Operational Research, 2001, 128(1): 34-57
14. Wu Yu-Liang, Huang Wen-Qi, Lau Siu-Chung, Wong C K, Young G H. An effective quasi-human based heuristic for solving the rectangle Packing problem. European Journal of Operational Research, 2002, 141(2): 341-358
15. Hifi M, Hallah R. A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes. International Transactions in Operational Research, 2003, 10(3): 195-216
16. Zhang De-Fu, Deng An-Sheng, Kang Yan. A hybrid heuristic algorithm for the rectangular Packing problem//Proceedings of the International Conference on Computational Science. Atlanta, GA, USA, 2005: 783-791