A memetic algorithm with adaptive operator selection for graph coloring
From MaRDI portal
Publication:6635978
DOI10.1007/978-3-031-57712-3_5MaRDI QIDQ6635978
Olivier Goudet, Cyril Grelier, Jin-Kao Hao
Publication date: 12 November 2024
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An exact approach for the vertex coloring problem
- Using tabu search techniques for graph coloring
- An efficient algorithm for computing the distance between close partitions
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A memetic algorithm for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- 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
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Iterated local search with tabu search for the weighted vertex coloring problem
- A survey on vertex coloring problems
- Batch Coloring Flat Graphs and Thin
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- 10.1162/153244303321897663
- Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
This page was built for publication: A memetic algorithm with adaptive operator selection for graph coloring
