Reinforcement learning based tabu search for the minimum load coloring problem

DOI10.1016/j.cor.2022.105745OpenAlexW4213301271WikidataQ114193085 ScholiaQ114193085MaRDI QIDQ2147014

Qinghua Wu, Una Benlic, Zhe Sun, Ming-Jie Li

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105745

zbMATH Keywords

integer programmingtabu searchgraph coloringreinforcement learningminimum load coloring problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems

Uses Software

• PERL
• TTTPLOTS
• irace
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Memetic search for the max-bisection problem
• An efficient memetic algorithm for the graph partitioning problem
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• Heuristic search to the capacitated clustering problem
• Hybrid evolutionary algorithms for graph coloring
• Parameterized and approximation algorithms for the load coloring problem
• Parameterized algorithms for load coloring problem
• On the minimum load coloring problem
• TTT plots: a perl program to create time-to-target plots
• A survey of local search methods for graph coloring
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• Sur le coloriage des graphs

This page was built for publication: Reinforcement learning based tabu search for the minimum load coloring problem