Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring

DOI10.1007/978-3-031-30035-6_7MaRDI QIDQ6149094

Olivier Goudet, Cyril Grelier, Jin-Kao Hao

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

local searchhyper-heuristicMonte Carlo tree searchweighted vertex coloringlearning-driven optimization

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• The \(k\)-coloring fitness landscape
• Solving vertex coloring problems as maximum weight stable set problems
• Using tabu search techniques for graph coloring
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• Models and heuristic algorithms for a weighted vertex coloring problem
• On Monte Carlo tree search for weighted vertex coloring
• Recent advances in selection hyper-heuristics
• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• Iterated local search with tabu search for the weighted vertex coloring problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Automata, Languages and Programming

This page was built for publication: Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring