Solving the Graph Coloring Problem Using Cuckoo Search

2017 ◽  
pp. 552-560 ◽  
Author(s):  
Claus Aranha ◽  
Keita Toda ◽  
Hitoshi Kanoh
Keyword(s):  
Graph Coloring ◽  
Cuckoo Search ◽  
Coloring Problem ◽  
Graph Coloring Problem

scholarly journals Solving Planar Graph Coloring Problem using Enhanced Cuckoo Search

2016 ◽  
Vol 9 (45) ◽  
Author(s):  
Sudhanshu Prakashtiwari ◽  
M. VijayaRaju ◽  
, Gurbakashphonsa ◽  
Deepak Kumar Deepu
Keyword(s):  
Planar Graph ◽  
Graph Coloring ◽  
Cuckoo Search ◽  
Coloring Problem ◽  
Graph Coloring Problem

A Binary Cuckoo Search Algorithm for Graph Coloring Problem

2014 ◽  
Vol 5 (3) ◽  
pp. 42-56 ◽  
Author(s):  
Halima Djelloul ◽  
Abdesslem Layeb ◽  
Salim Chikhi
Keyword(s):  
Combinatorial Optimization ◽  
Graph Coloring ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Coloring Problem ◽  
Combinatorial Optimization Problems ◽  
Hybrid Approaches ◽  
Graph Coloring Problem

The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm. To show the feasibility and the effectiveness of the algorithm, it has used the standard DIMACS benchmark, and the obtained results are very encouraging.

A Metaheuristic Algorithm to Face the Graph Coloring Problem

2020 ◽  
pp. 195-208
Author(s):  
A. Guzmán-Ponce ◽  
J. R. Marcial-Romero ◽  
R. M. Valdovinos ◽  
R. Alejo ◽  
E. E. Granda-Gutiérrez
Keyword(s):  
Graph Coloring ◽  
Metaheuristic Algorithm ◽  
Coloring Problem ◽  
Graph Coloring Problem

scholarly journals Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 246
Author(s):  
Yuri N. Sotskov ◽  
Еvangelina I. Mihova
Keyword(s):  
Graph Coloring ◽  
Precedence Constraints ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Due Dates ◽  
Mixed Graph ◽  
Coloring Problem ◽  
Release Times ◽  
Schedule Length ◽  
Graph Coloring Problem

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness for integer due dates to the scheduling problem, where along with precedence constraints given on the set of the multiprocessor tasks, a subset of tasks must be processed simultaneously. Contrary to a classical shop-scheduling problem, several processors must fulfill a multiprocessor task. Furthermore, two types of the precedence constraints may be given on the task set . We prove that the extended scheduling problem with integer release times of the jobs to minimize schedule length may be solved as an optimal mixed graph coloring problem that consists of the assignment of a minimal number of colors (positive integers) to the vertices of the mixed graph such that, if two vertices and are joined by the edge , their colors have to be different. Further, if two vertices and are joined by the arc , the color of vertex has to be no greater than the color of vertex . We prove two theorems, which imply that most analytical results proved so far for optimal colorings of the mixed graphs , have analogous results, which are valid for the extended scheduling problems to minimize the schedule length or maximal lateness, and vice versa.

Sign in / Sign up

Export Citation Format

Share Document