查詢結果分析
相關文獻
- Complexity Estimation for Genetic Assembly Sequence Planning
- The Calculation of Complexity in Normal and Apoplectic EEG Signals
- 都市計畫草圖替選方案分析模式之實例研究
- 運用類神經網路於股價指數之套利--以日經225指數為例
- 二次元靜態連續體結構之最佳化:應用族群概念之基因演算法
- 遺傳基因演算法在彈性製造系統排程問題之探討
- 適應性突變運算及其運用
- 基因演算專家系統在血液透析室護理人員排班的應用
- Measurements for Rule Based Systems
- Reinforcement Learning for Ga-Based Neural Networks
第1筆 /總和 1 筆
/ 1 筆
頁籤選單縮合
題名 | Complexity Estimation for Genetic Assembly Sequence Planning=組裝順序規劃之複雜度估計 |
---|---|
作者姓名(中文) | 王文派; 曾懷恩; | 書刊名 | 工業工程學刊 |
卷期 | 26:1 2009.01[民98.01] |
頁次 | 頁44-52 |
分類號 | 494.542 |
關鍵詞 | 組裝規劃; 基因演算法; 複雜度; 引導式基因演算法; Assembly planning; Genetic algorithms; Complexity; Guided-GAs; |
語文 | 英文(English) |
中文摘要 | 組裝規劃涉及由相關的限制因素(幾何特性、時間、工具、機臺)考量安排可行的組裝順序,進而決定特定之組裝的優先順序,故組裝規劃屬於限制複雜型態的問題,而在此類問題中採用傳統基因演算法對於尋找可行解甚或是最佳解,進而確認係整體最佳而言,可謂艱困而費力的工程;過去,引導式基因演算法的提出就是為了修正傳統基因演算法的缺點,這種演算是專門用來解決複雜限制式型態的基因演算法,然而衍生的問題是何謂複雜限制式的問題,故本研究目的旨在為建立一複雜度的衡量指標,以利往後作爲演算法採用的參考依據,透過實例的驗證,當指標在70以上時可以稱為複雜的限制式問題。 |
英文摘要 | Assembly planning involves in determining a particular assembly priority from which associated restraint factors such as geometric features, assembly time, tools, and machines are taken into account of arranging a feasible assembly sequence based upon the planner's individual heuristics. Suchlike planning lately may implement genetic algorithms (GAs) to go towards the assembly sequence features of speed and flexibility. However, finding feasible solutions or even optimal solutions is arduous to identify the global optimal solution in a short period. The purpose of this paper essentially aims at establishing a complexity index for practitioners to decide what type of algorithm employed, namely traditional GAs, or ameliorative GAs like Guided-GAs. The threshold of the proposed complexity judgment is hinged on the square of preceding constraints and the quantity of nodes in the event. As the complexity increases the frequency of feasible solutions found did not exactly come up by traditional GAs. According to the proposed index assembly sequence problems are asserted more constraints comparatively while the complexity approaches to 70 or above. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。