查詢結果分析
相關文獻
- 主線欄柵式收費站最佳區位遺傳演算尋優法與逐步尋優法之比較分析
- 線性軸幅路網接駁系統最適整合區位、路線與排班模式之研究
- Genetic Algorithm Approach for Designing Fir Hilbert Transformers and Differentiators
- 以類神經網路與遺傳演算法解決系統可用度分派問題
- 自我調適的動態排程系統--限制排程、模糊理論和遺傳演算法的應用
- 用無母數的網路學習於臺股認購權證的定價
- 應用遺傳演算法優選大埔水庫排砂操作規線
- 手寫數字辨識模式之建立--結合遺傳演算法與類神經網路
- A Genetic Algorithm for Tuning Reliable Fuzzy System
- 以模糊理論和遺傳演算法為基礎的中文文件自動分類之研究
頁籤選單縮合
題 名 | 主線欄柵式收費站最佳區位遺傳演算尋優法與逐步尋優法之比較分析=A Comparison of Genetic and Stepwise Algorithms for Optimal Sites of Mainline Barrier-Type Toll Stations |
---|---|
作 者 | 曾國雄; 邱裕鈞; 許書耕; | 書刊名 | 中國土木水利工程學刊 |
卷 期 | 9:1 1997.03[民86.03] |
頁 次 | 頁171-178 |
分類號 | 557.3 |
關鍵詞 | 主線欄柵式收費站; 逐步尋優方法; 遺傳演算法; Mainline barrier-type toll station; Stepwise algorithm; Genetic algorithm; |
語 文 | 中文(Chinese) |
中文摘要 | 收費站區位之評選本質上係屬NP-hard問題,對於規模較大之問題勢必得建立一套具高精確度且高效率性之尋優模式,方能求解。逐步尋優方法即針對此一問題而建立,其尋優結果亦證明頗為可行。惟該法必須先固定收費站數,再進行各站之區位尋優,程序上較為複雜,且尚無法保證能求得整體最佳解。 有鑑於遺傳演算法求解NP-hard問題之適用性強,且區位評選係0-1整數規劃問題,無需額外之編碼與解碼動作。本文即以遺傳演算法,構建收費站區位之評選模式。以北二高及中山高為實例分析時,證明遺傳演算法之求解效率均優於逐步尋優法。 |
英文摘要 | Determination of the optimal sites of toll stations is an NP-hard problem. It is infeasible without an efficient and robust algorithm for the large-scaled problems. Stepwise algorithm (SA) has been developed to solve these problems. However, SA has a complicated procedure in that the total number of toll stations must be given in advance and then SA searches the site for each toll station. In addition, there is no guarantee that the global optimal solution can be found. As GA is especially suitable for solving NP-hard problems and site selection is a 0-1 integer programming problem that does not need additional GA coding and decoding processes, we develop a GA model to search the optimal sites of toll stations. The results show that GA is proved to be more efficient than SA by the case studies of the NOrthern Second freeway and Sun Yat-Sen freeway. |
本系統中英文摘要資訊取自各篇刊載內容。