版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進行舉報或認領(lǐng)
文檔簡介
1、華中科技大學碩士學位論文求解等圓Packing問題的快速優(yōu)化算法研究姓名:吳慶華申請學位級別:碩士專業(yè):計算機軟件與理論指導(dǎo)教師:許如初20090525II華 中 科 技 大 學 碩 士 學 位 論 文 Abstract The congruent circles packing problem is a very typical layout optimization problem as well as a very repres
2、entative NP-hard problem, NP-hard problem is a very difficult problem to solve in modern computer science. Modern scientific research shows that there is no precision and strict integrity algorithm as required by classic
3、al mathematical for solving the NP-hard problem. Therefore, high performance heuristic approximation algorithm is designed to solve NP-hard problem. Research on this issue has very important practical application value.
4、Quasi-Physical algorithm is designed for solving the congruent circles packing problem instead of using other international popular algorithm. A physical motion model is taken to solve the congruent circles packing probl
5、em. According to our experiments, the Quasi-Physical algorithm is very effective in solving the congruent circles packing problem. Some methods are proposed to further improve the performance of the Quasi-Physical algori
6、thm. The local search forecast strategy is introduced on the basis of the Quasi-Physical algorithms. In the process of executing the local search forecast strategy, the possibility of obtaining the optimal solution is fo
7、recasted constantly. If the current pattern is judged as a local minimal pattern, the current searching path will be ended and a new searching path will be restarted. With this strategy, a lot of unnecessary calculation
8、is avoided. Using the optimal step size strategy, step size is adjusted continually to make the calculation obtain a faster convergence rate. On how to escape from the trap of local minimum of the congruent circles packi
9、ng problem, several Quasi-Physical-Human strategies are proposed on the basis of the Quasi-Physical algorithm. The Quasi-Physical algorithm is combined with the Quasi-Physical-Human strategies. A specific Quasi-Physical-
10、Human strategy is selected to use by probability according to the current pattern feature. The benchmark of the circles packing problem and the performance of the Quasi-Physical-Human algorithm on the benchmark are intro
溫馨提示
- 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 眾賞文庫僅提供信息存儲空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負責。
- 6. 下載文件中如有侵權(quán)或不適當內(nèi)容,請與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準確性、安全性和完整性, 同時也不承擔用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。
最新文檔
- 求解等圓packing問題的擬物擬人算法.pdf
- 求解等圓Packing問題的完全擬物算法.pdf
- 求解等圓packing問題的高性能近似算法.pdf
- 求解等圓Packing問題的遺傳擬物混合算法.pdf
- 求解等圓packing問題的擬物擬人算法改進策略研究.pdf
- 求解不等球和不等圓Packing問題的高性能算法研究.pdf
- 求解矩形packing問題的純粹擬人算法.pdf
- 求解二維矩形packing問題的高效算法設(shè)計.pdf
- 求解長方體Packing問題的最大穴度算法.pdf
- 求解帶平衡約束的圓形Packing問題的擬物擬人算法.pdf
- 求解圓形Packing問題的過程模擬方法.pdf
- 等球Packing問題的啟發(fā)式研究.pdf
- 求解圓形Packing問題及模型蛋白結(jié)構(gòu)預(yù)測問題的啟發(fā)式算法.pdf
- 帶平衡約束的圓和矩形正交Packing問題的擬物擬人算法研究.pdf
- 各種優(yōu)化算法求解函數(shù)優(yōu)化問題
- 各種優(yōu)化算法求解函數(shù)優(yōu)化問題
- 各種優(yōu)化算法求解函數(shù)優(yōu)化問題
- 求解連續(xù)優(yōu)化問題的混合蛙跳算法研究.pdf
- 求解眾目標優(yōu)化問題的演化算法研究.pdf
- 求解全局優(yōu)化問題的眺望算法.pdf
評論
0/150
提交評論