頁籤選單縮合
題名 | A Tabu-Search Based Algorithm for Concave Cost Transportation Network Problems=禁制搜尋法於求解凹形成本運輸網路問題之研究 |
---|---|
作者姓名(中文) | 顏上堯; 羅守正; | 書刊名 | 中國工程學刊 |
卷期 | 21:3 1998.05[民87.05] |
頁次 | 頁327-335 |
分類號 | 441.3 |
關鍵詞 | 凹形成本; 運輸問題; 禁制搜尋法; Concave cost; Transportation problem; Tabu search; |
語文 | 英文(English) |
中文摘要 | 本研究運用禁制搜尋法技巧,發展一演算法,以有效的求解凹形成本運輸 網路問題。此網路問題在運算上可歸類為NP-hard問題。在此研究中,我們亦 發展一起始解法及一線性估計法,以評估求解的績效。目前結果顯示,本研究 發展之禁制搜尋法的效果頗佳。 |
英文摘要 | This research employs the tabu search method to develop an algorithm for efficiently solving concave cost transportation network problems which are characterized as NP-hard. An initial solution method and a linear approximation approach are also developed, to evalutate the algorithm. The perliminary results show that the algorithm is potentially useful. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。