國立虎尾科技大學 |

Exploring Monte Carlo Tree Search for Combinatorial Optimization Problems.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Exploring Monte Carlo Tree Search for Combinatorial Optimization Problems./
作者:	Jeon, Ye Jin.
面頁冊數:	1 online resource (29 pages)
附註:	Source: Masters Abstracts International, Volume: 85-12.
Contained By:	Masters Abstracts International85-12.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798383087190

Exploring Monte Carlo Tree Search for Combinatorial Optimization Problems.
Jeon, Ye Jin.

Exploring Monte Carlo Tree Search for Combinatorial Optimization Problems. - 1 online resource (29 pages)

Source: Masters Abstracts International, Volume: 85-12.

Thesis (M.S.)--University of California, San Diego, 2024.

Includes bibliographical references

This thesis proposes a general search algorithm design for hard combinatorial optimization problems. Monte Carlo Tree Search(MCTS) method is a heuristic search method that partitions the search space balancing exploration and exploitation. The goal is to develop an MCTS framework to navigate the combinatorial input domain that uses existing black-box solvers as subroutines. We design different ways to partition the input regions with MCTS and analyze their search efficiency based on experimental results with different combinatorial problems. The experiments show this framework can outperform other search frameworks and state-of-the-art commercial solvers such as Gurobi by finding more optimized solutions in a shorter wall-clock time.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798383087190Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

Combinatorial problemsIndex Terms--Genre/Form:

554714
Electronic books.

Exploring Monte Carlo Tree Search for Combinatorial Optimization Problems.
LDR:02017ntm a22003617 4500 001 1150213
005 20241022111615.5
006 m o d
007 cr bn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798383087190
035 $a (MiAaPQ)AAI31301860
035 $a AAI31301860
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Jeon, Ye Jin. $3 1476655
245 1 0 $a Exploring Monte Carlo Tree Search for Combinatorial Optimization Problems.
264 0 $c 2024
300 $a 1 online resource (29 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 85-12.
500 $a Advisor: Gao, Sicun.
502 $a Thesis (M.S.)--University of California, San Diego, 2024.
504 $a Includes bibliographical references
520 $a This thesis proposes a general search algorithm design for hard combinatorial optimization problems. Monte Carlo Tree Search(MCTS) method is a heuristic search method that partitions the search space balancing exploration and exploitation. The goal is to develop an MCTS framework to navigate the combinatorial input domain that uses existing black-box solvers as subroutines. We design different ways to partition the input regions with MCTS and analyze their search efficiency based on experimental results with different combinatorial problems. The experiments show this framework can outperform other search frameworks and state-of-the-art commercial solvers such as Gurobi by finding more optimized solutions in a shorter wall-clock time.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
653 $a Combinatorial problems
653 $a Algorithm design
653 $a Black-box solvers
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, San Diego. $b Computer Science and Engineering. $3 1189479
773 0 $t Masters Abstracts International $g 85-12.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31301860 $z click for full text (PQDT)