書誌事項
- タイトル別名
-
- Multi-Point Tabu Search with Interaction Based on Distance
この論文をさがす
抄録
This paper proposes proximate optimality principle (POP) based multi-point tabu search, for solving combinatorial optimization problems. While the similarity measure of POP is defined using the concept of metric space on combinatorial optimization problems, some numerical simulations using several types of combinatorial optimization benchmark problems investigate POP. The proposed algorithm is applied to some typical combinatorial optimization problems in order to verify the performance of the proposed algorithm.
収録刊行物
-
- 電気学会論文誌C(電子・情報・システム部門誌)
-
電気学会論文誌C(電子・情報・システム部門誌) 129 (7), 1379-1380, 2009
一般社団法人 電気学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001204604621696
-
- NII論文ID
- 10025101442
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可