查詢結果分析
來源資料
頁籤選單縮合
題 名 | A Tabu Search Approach to the Generalized Assignment Problem=以禁忌搜尋演算法求解一般化指派問題 |
---|---|
作 者 | 吳泰熙; 葉進儀; 蕭育如; | 書刊名 | 工業工程學刊 |
卷 期 | 21:3 2004.05[民93.05] |
頁 次 | 頁301-310 |
分類號 | 494.5 |
關鍵詞 | 一般化指派問題; 禁忌搜尋演算法; 動態禁忌名單; Assignment; Generalized assignment problem; Tabu search; Cell formation problem; |
語 文 | 英文(English) |
中文摘要 | 一般化指派問題尋求最大利潤或最小成本之工作指派計畫,其應用面非常廣泛,單元形成問題即是一例。本文提出一禁忌搜尋演算法TSDL來求解一般化指派問題,該演算法利用了動態禁忌名單及長期記憶體機制。為驗證本演算法之效用及效率,我們採用了84題文獻範例,並與現存文獻標竿演算結果做一比較後,發現TSDL可以於極短之演算時間內求得品質甚佳之演算結果。 |
英文摘要 | The generalized assignment problem (GAP) determines the maximum profit or minimum cost assignment of n jobs to m agents, which is a problem embedded in the cell formation problem. In this paper, a tabu search heuristic, TSDL that consists of dynamic tabu tenure with long-term memory mechanism is presented to solve the GAPs. A standard set of 84 test problems adopted from the literature is used to evaluate the performance of the proposed algorithm and for comparison with other existing methods. The TSDL can very efficiently find solutions with good quality. The proposed algorithm should thus be useful to practitioners and researchers. |
本系統中英文摘要資訊取自各篇刊載內容。