電気学会論文誌C(電子・情報・システム部門誌)
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<システム>
Proximate Optimality Principle に基づくTabu Search
金澤 貴彦安田 恵一郎
著者情報
ジャーナル フリー

2004 年 124 巻 3 号 p. 912-920

詳細
抄録
Meta-heuristics is a new paradigm that aims to obtain an approximate solution within a feasible computation time. In the meta-heuristics, Tabu Search is one of the most effective algorithms for solving combinatorial optimization problems. While the intensification of Tabu Search is powerful, the diversification of Tabu Search is not powerful. This paper proposes an algorithm - Multi Criteria Tabu Search coordinating the intensification and the diversification based on a Proximate Optimality Principle (POP) - which has several advantages for solving combinatorial optimization problems. The proposed algorithm is applied to some traveling salesman problems which are typical combinatorial optimization problems in order to verify the performance of the proposed algorithm.
引用文献 (16)
著者関連情報
被引用文献 (7)
© 電気学会 2004
前の記事 次の記事
feedback
Top