A memetic algorithm for graph coloring

DOI10.1016/J.EJOR.2009.07.016zbMath1176.90610OpenAlexW2100024690MaRDI QIDQ1043356

Zhipeng Lü, Jin-Kao Hao

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.016

zbMATH Keywords

graph coloringmemetic algorithmcrossover operatorpool updating

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (29)

Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ An effective discrete dynamic convexized method for solving the winner determination problem ⋮ Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ A memetic algorithm for the minimum sum coloring problem ⋮ An exact algorithm with learning for the graph coloring problem ⋮ Tabu search for the cyclic bandwidth problem ⋮ Memetic search for the max-bisection problem ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ Total coloring and total matching: polyhedra and facets ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ A massively parallel evolutionary algorithm for the partial Latin square extension problem ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ A memetic algorithm for deinterleaving pulse trains ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ Quantum annealing of the graph coloring problem ⋮ Multi-coloring and job-scheduling with assignment and incompatibility costs ⋮ Graph Coloring Models and Metaheuristics for Packing Applications ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ Optimization by ant algorithms: possible roles for an individual ant ⋮ Uncertain vertex coloring problem ⋮ The freight consolidation and containerization problem ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ An incremental search heuristic for coloring vertices of a graph ⋮ INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• Graph colouring approaches for a satellite range scheduling problem
• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• Variable space search for graph coloring
• A search space ``cartography for guiding graph coloring heuristics
• Improving heuristics for the frequency assignment problem
• On a graph-theoretical model for cyclic register allocation
• A variable neighborhood search for graph coloring.
• Coloration neighbourhood search with forward checking
• Genetic and hybrid algorithms for graph coloring
• Hybrid evolutionary algorithms for graph coloring
• A graph-based hyper-heuristic for educational timetabling problems
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• An adaptive memory algorithm for the \(k\)-coloring problem
• A survey of local search methods for graph coloring
• A Metaheuristic Approach for the Vertex Coloring Problem
• A graph coloring algorithm for large scheduling problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• An application of graph coloring to printed circuit testing
• New methods to color the vertices of a graph
• Bag rationalisation for a food manufacturer
• A GRASP for coloring sparse graphs

This page was built for publication: A memetic algorithm for graph coloring