Monte Carlo Tree Search Method for Solving the Knapsack Problem
-
- Iima Hitoshi
- Kyoto Institute of Technology
-
- Hyono Takumi
- Kyoto Institute of Technology
Bibliographic Information
- Other Title
-
- モンテカルロ木探索によるナップサック問題の解法
- モンテカルロ モク タンサク ニ ヨル ナップサック モンダイ ノ カイホウ
Search this article
Abstract
<p>Monte Carlo tree search is used in AlphaGo Zero which is a strong artificial intelligence player for Go, and therefore it has attracted much attention. It can be used for searching for the optimum of combinatorial optimization problems, and it is promising for finding the optimum or a near-optimum. This paper proposes a Monte Carlo tree search method for the knapsack problem which is one of the typical combinatorial optimization problems. In the proposed method, a new candidate solution is generated by using superior ones found so far in the procedure called the simulation. Its performance is evaluated through conducting numerical experiments.</p>
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 140 (10), 1141-1146, 2020-10-01
The Institute of Electrical Engineers of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390285697607071232
-
- NII Article ID
- 130007920900
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 030688424
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed