DocumentCode
1692380
Title
Solving geometric constraints with niche genetic simulated annealing algorithm
Author
Sheng-Li, Liu ; Min, Tang ; Shang-Ching, Chou ; Jin-Xiang, Dong
Author_Institution
State Key Lab. of CAD&CG, ZheJiang Univ., Hangzhou, China
Volume
1
fYear
2004
Firstpage
679
Abstract
This paper proposes a novel algorithm to solve the geometric constraint solving, which integrates the niche algorithm (NA) well with the simulated annealing algorithm (SAGA). This method makes full use of the advantages of SAGA and NA. It can handle the under-/over-constraint problems naturally. NA can make this algorithm find all the solutions for the multi-solution constraint system. SAGA can make this algorithm solve the constraint equations robustly. Our experiments have proved the robustness and efficiency of this method.
Keywords
computational geometry; constraint handling; genetic algorithms; simulated annealing; constraint equations; genetic algorithm; geometric constraint problems; multisolution constraint system; over-constraint problems; simulated annealing; under-constraint problems; Artificial intelligence; Computational modeling; Computer simulation; Equations; Genetics; Iterative methods; Laboratories; Robustness; Simulated annealing; Solid modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on
Print_ISBN
0-7803-7941-1
Type
conf
DOI
10.1109/CACWD.2004.1349111
Filename
1349111
Link To Document