Hybrid evolutionary algorithms for graph coloring
From MaRDI portal
Publication:1970334
DOI10.1023/A:1009823419804zbMath0958.90071OpenAlexW1582334898MaRDI QIDQ1970334
Philippe Galinier, Jin-Kao Hao
Publication date: 18 April 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009823419804
combinatorial optimizationtabu searchgraph coloringhybrid algorithmscrossover operatorssolution recombination
Related Items
Lower Bounds for the Minimal Sum Coloring Problem ⋮ Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ Heuristic search to the capacitated clustering problem ⋮ Three tabu search methods for the MI-FAP applied to 802.11 networks ⋮ Graph colouring approaches for a satellite range scheduling problem ⋮ Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ Distance-constrained grid colouring ⋮ A three-phased local search approach for the clique partitioning problem ⋮ Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ Reinforcement learning based tabu search for the minimum load coloring problem ⋮ A memetic algorithm for the minimum sum coloring problem ⋮ Towards objective measures of algorithm performance across instance space ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Memetic search for the max-bisection problem ⋮ A Tabu Search Heuristic for the Equitable Coloring Problem ⋮ Simple decentralized graph coloring ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ When a genetic algorithm outperforms hill-climbing ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ The Relation Between Complete and Incomplete Search ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ An efficient algorithm for computing the distance between close partitions ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ Genetic tabu search for robust fixed channel assignment under dynamic traffic data ⋮ A massively parallel evolutionary algorithm for the partial Latin square extension problem ⋮ Partitioning through projections: strong SDP bounds for large graph partition problems ⋮ A memetic algorithm for deinterleaving pulse trains ⋮ Adaptive feasible and infeasible tabu search for weighted vertex coloring ⋮ Heuristics for a project management problem with incompatibility and assignment costs ⋮ An exact approach for the vertex coloring problem ⋮ Quantum annealing of the graph coloring problem ⋮ Guidelines for the use of meta-heuristics in combinatorial optimization. ⋮ Genetic local search with distance preserving recombination operator for a vehicle routing problem. ⋮ A variable neighborhood search for graph coloring. ⋮ A new ant colony optimization algorithm for the lower bound of sum coloring problem ⋮ Decomposition of realizable fuzzy relations ⋮ Unnamed Item ⋮ Multi-coloring and job-scheduling with assignment and incompatibility costs ⋮ A cooperative search method for the \(k\)-coloring problem ⋮ The general \(\alpha \)-decomposition problem of fuzzy relations ⋮ A graph coloring heuristic using partial solutions and a reactive tabu scheme ⋮ Graph Coloring Models and Metaheuristics for Packing Applications ⋮ An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem ⋮ A survey on vertex coloring problems ⋮ A particle swarm optimizer for grouping problems ⋮ A semidefinite programming-based heuristic for graph coloring ⋮ An ant-based algorithm for coloring graphs ⋮ Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ Efficient algorithms for finding critical subgraphs ⋮ An adaptive memory algorithm for the \(k\)-coloring problem ⋮ An improved ant colony optimisation heuristic for graph colouring ⋮ Variable space search for graph coloring ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ Consistent neighborhood search for combinatorial optimization ⋮ Distance preserving recombination operator for Earth observation satellites operations scheduling ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ An evolutionary approach for bandwidth multicoloring problems ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ Coloring large graphs based on independent set extraction ⋮ A new \textsf{DSATUR}-based algorithm for exact vertex coloring ⋮ About equivalent interval colorings of weighted graphs ⋮ Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths ⋮ An exact method for graph coloring ⋮ A survey of local search methods for graph coloring ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Improving the extraction and expansion method for large graph coloring ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Genetic local search for multi-objective combinatorial optimization ⋮ Hybrid population-based algorithms for the bi-objective quadratic assignment problem ⋮ On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing ⋮ Two heuristics for the one-dimensional bin-packing problem ⋮ Combinatorial optimization in system configuration design ⋮ An efficient memetic algorithm for the graph partitioning problem ⋮ Graph coloring by multiagent fusion search ⋮ A search space ``cartography for guiding graph coloring heuristics ⋮ On a parallel genetic-tabu search based algorithm for solving the graph colouring problem ⋮ A memetic algorithm for graph coloring ⋮ INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING ⋮ AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem
