DocumentCode
479737
Title
An Optimizing Nesting Algorithm with Heuristic Search Based on Binary Trees
Author
Ji, Hua ; Yu, Zhilou
Author_Institution
Dept. of Comput. Sci., Shandong Normal Univ., Jinan
Volume
1
fYear
2008
fDate
12-14 Dec. 2008
Firstpage
124
Lastpage
127
Abstract
This paper proposes an optimizing nesting algorithm with heuristic search, which expresses the nesting process of rectangular blocks by building binary trees. With the combination rule and adjacency rule being applied, the algorithmic complexity can be decreased rapidly and nesting solutions can also be improved greatly to satisfy industrial demands.
Keywords
combinatorial mathematics; computational complexity; optimisation; tree searching; trees (mathematics); binary trees; heuristic search; optimizing nesting algorithm; Algorithm design and analysis; Binary trees; Computer science; Heuristic algorithms; Research and development; Sheet materials; Software algorithms; Software engineering; combination rule; heuristic search; nesting layout;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-0-7695-3336-0
Type
conf
DOI
10.1109/CSSE.2008.732
Filename
4721707
Link To Document