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

DOI10.1007/978-3-031-30035-6_7MaRDI QIDQ6149094zbMATH OpenFDO

Authors Cyril Grelier, Olivier Goudet, Jin-Kao Hao

Publication date 12 January 2024

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

Full work available at URL https://doi.org/10.1007/978-3-031-30035-6_7

zbMATH Keywords

hyper-heuristiclearning-driven optimizationlocal searchMonte Carlo tree searchweighted vertex coloring

Mathematics Subject Classification ID

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

Cites work

• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• Automata, Languages and Programming
• Iterated local search with tabu search for the weighted vertex coloring problem
• 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
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Recent advances in selection hyper-heuristics
• Solving vertex coloring problems as maximum weight stable set problems
• The \(k\)-coloring fitness landscape
• Using tabu search techniques for graph coloring

Cited in

(2)

• A memetic algorithm with adaptive operator selection for graph coloring
• Towards more efficient local search for weighted graph coloring problem in massive graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149094)