在本論文研究中，我們設計實做一組最佳化搜尋演算法的軟體結構，以便利最佳化搜尋程式的實做。我們提供模組互動圖的設計，包含模組、埠與連結埠的互動通道。設計者可將複雜的最佳化搜尋問題分解為數個子問題，再將子問題的解法對應到階層式模組內的行為設計。最後使用通道整合模組間的行為。由於最佳化搜尋演算法可以推演一組乃至多組的解，我們規劃解集合的資料組織以支援設計者規劃的搜尋方式。最佳化過程中通常會對完整解或部份解作評量與分析，由於所費時間甚多且重複，我們規劃了評量結果的動態規劃方法，以重用的方式降低重複計算時間與儲存空間。最後，由於推演所產生的新解僅有少部份的修改，因此我們規劃階層式決策代表法與其降低複製的維護方式，以進一步增進其執行速度。

In this research, we designed and implemented optimization search algorithms to facilitate implementation of optimization search software. We provided the design of module interaction graph including modules, ports, and channels. We can map solving algorithms of sub-problems onto behavioral designs incorresponding modules. Finally, they can integrate module’s with channels. Since optimization search algorithms may evolve one to several solutions at the same time, we planned a solution set organization to support designer-planned search strategy. During the optimization process, solutions or sub-solutions should be evaluated and analyzed. Because excessive executive time as commonly spent in replicated evaluation, we planned dynamic programming for reusing evaluation results to reduce replicated evaluation time. Lastly, when evolving new solutions, usually only a small number of decisions are changed. We planed a hierarchical decision representation and maintenance operations to reduce replication of common parts among solutions to further enhance its execution speed.

1緒論 1
1.1研究動機 1
1.2研究背景 2
1.3研究目的 5
1.4論文組織 5
2最佳化演算法的設計環境 7
2.1設計環境 7
2.2模組互動圖(MODULE INTERACTIVE GRAPH) 8
2.3互動通道 10
2.4階層式決策代表法(HIERARCHICAL DECISION REPRESENTATION)與最佳化搜尋模型(OPTIMIZATION SEARCH MODEL) 16
2.5評量結果的動態規劃 21
3最佳化演算法的設計環境的軟體規劃 24
3.1軟體設計規劃 24
3.2模組互動圖 25
3.3互動通道 26
3.4階層式決策代表法(HIERARCHICAL DECISION REPRESENTATION) 26
3.5 評量結果的動態規劃 27
3.6設計流程 28
4結論 29
參考資料 30

[1] Simon, H. A, The science of artifical. The MIT Press, 1968.

[2] Sorell, T. (Ed.), A discourse on method: Meditations and principles, Hackett Publishing,1998.

[3] Ralph E. Johnson. “Frameworks = (components + patterns),” ACM, Vol. 40 No. 10, 1997.

[4] J. Bhasker, A SystemC Primer, Star Galaxy Pub, Second Edition, 2004.

[5] Kay A. Robbins, Steven Robbins, UNIX Systems Programming, Prentice-Hall, 1996.

[6] Richard Bellman, Dynamic Programming, Princeton University Press, 2003.

[7] Tsung Lee, Pen-Ho Yu, “Efficient representation of Algebraic Expressions,” Lecture Notes in Computer Science, Springer Verlag, 2004.

[8] Judea Pearl, Heuristics: Intelligent search strategies for computer problem solving, Addison-Wesly, 1984.

[9] Ellis Horowitz, Staraj Sahni, and Susan Anderson-Freed, Fundamentals of Data Structures in C, Silicon Press, 2nd edition, 2008

[10] Hennessy, Patterson, Computer Architecture, A Quantiative Approach, Morgan Kaufmann, 2003

[11] Tsung Lee, Design Framework of efficient Optimization Search Software Architecture, Internal Research Memo, Computing System Lab. Dept. of Electrical Eng., National Sun Yat-Sen Univ, June 2008.