| Summary: | 碩士 === 立德管理學院 === 應用資訊研究所 === 94 === Based on the conventional simulated annealing algorithm, the construction of high efficient orthogonal simulated annealing algorithm is proposed in this thesis that makes use of various perturbation mechanisms and systematizes the current solutions into a group of possible solutions with a few perturbation operations required. By using the factorial analysis in the orthogonal experimental design, an Intelligent generation mechanisms for new solution contained with a group of perturbation operations will be deduced from the former operation results. Eventually an accurate and best perturbation group in vicinity will quickly come into being and we can get the optimal solution.
In order to disclose the differences between the orthogonal and the conventional simulated annealing algorithm, This thesis first of all, has done severval experiments with operating ten factorial formulae with varied difficulties. It shown that the results from the former algorithm are better than from the latter one. Secondly, sequence pair representation is introduced into the VLSI floorplanning to reflect the placement of each construction group. Finally, five standard testing modules such as MCNC (Apte, Xerox, Hp, Ami33, Ami49)are evaluated. These results shown that the measures put forward in this thesis and other research products in related works will perfect the current measures effectively on the solution of grand floorplanning.
|
|---|
