書誌事項
- タイトル別名
-
- Combinatorial Optimization Method Based on Quantitative Evaluation of Proximate Optimality Principle
- キンセツ サイテキセイ ゲンリ ノ テイリョウテキ ヒョウカ ニ モトズク クミアワセ サイテキ カ シュホウ
この論文をさがす
抄録
It is known that many actual optimization problems can be formulated as combinatorial optimization problems. Meta-heuristics, which is a category of approximation algorithm as an effective method in complex and large scale combinatorial optimization problems, attracts expectation in recent years. This study focuses on Proximate Optimality Principle (POP). POP is the principle that good solutions posses some similar structure and experientially known that it holds for many combinatorial optimization problems. In this study, POP is quantitatively evaluated from the view points of parts and distance, and can be applied to search of optimization method. The proposed combinatorial optimization method based on quantitatively evaluated POP has higher optimality and lower computational complexity than conventional neighborhood search methods.
収録刊行物
-
- 電気学会論文誌Ｃ（電子・情報・システム部門誌）
-
電気学会論文誌Ｃ（電子・情報・システム部門誌） 133 (6), 1218-1228, 2013
一般社団法人 電気学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282679586314240
-
- NII論文ID
- 10031175306
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL書誌ID
- 024700179
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可