2022
DOI: 10.1007/978-3-031-04148-8_1
|View full text |Cite
|
Sign up to set email alerts
|

On Monte Carlo Tree Search for Weighted Vertex Coloring

Abstract: This work investigates the Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. In addition to the basic MCTS algorithm, we study several MCTS variants where the conventional random simulation is replaced by other simulation strategies including greedy and local search heuristics. We conduct experiments on well-known benchmark instances to assess these combined MCTS variants. We provide empirical evidence to shed light on the advantages and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…They use this algorithm to produce good solutions for instances of Crossword Puzzle Construction and Morpion Solitaire. A more classical problem is tackled by Grelier et al [44]. They combine several dedicated heuristics for the weighted vertex covering problem with Monte Carlo tree search and provide empirical evidence for the advantages and disadvantages of the different algorithmic variants.…”
Section: Monte Carlo Tree Searchmentioning
confidence: 99%
“…They use this algorithm to produce good solutions for instances of Crossword Puzzle Construction and Morpion Solitaire. A more classical problem is tackled by Grelier et al [44]. They combine several dedicated heuristics for the weighted vertex covering problem with Monte Carlo tree search and provide empirical evidence for the advantages and disadvantages of the different algorithmic variants.…”
Section: Monte Carlo Tree Searchmentioning
confidence: 99%
“…For the k-col, two particularly interesting local search heuristics are TabuCol [15] and PartialCol [2], which were proposed many years ago. For the WVCP, dedicated and effective local search procedures are much more recent, including AFISA [29], RedLS [30], ILS-TS [22] and TabuWeight [12]. None of these methods really dominates the others for all reference instances of the k-col and the WVCP [2,12,22].…”
Section: Introductionmentioning
confidence: 99%
“…For the WVCP, dedicated and effective local search procedures are much more recent, including AFISA [29], RedLS [30], ILS-TS [22] and TabuWeight [12]. None of these methods really dominates the others for all reference instances of the k-col and the WVCP [2,12,22]. It would be interesting to choose an appropriate local search to solve each type of instance for each problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In UAV-aided wireless systems, UAV planning problems are addressed using the random-MCTS (R-MCTS) strategy [48]. Furthermore, the greedy-MCTS (G-MCTS) strategy and a combined approach of the random-greedy simulation strategy (random-greedy-MCTS, RG-MCTS) can effectively tackle the weighted vertex coloring problem [49]. However, only some studies leverage MCTS to solve UAV task allocation challenges.…”
Section: Introductionmentioning
confidence: 99%