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.

Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm

2019 ◽  
Vol 10 (3) ◽  
pp. 23-45 ◽  
Author(s):  
Karim Baiche ◽  
Yassine Meraihi ◽  
Manolo Dulva Hina ◽  
Amar Ramdane-Cherif ◽  
Mohammed Mahseur
Keyword(s):  
Graph Coloring ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Random Parameters ◽  
Dragonfly Algorithm ◽  
Coloring Problem ◽  
Combinatorial Optimization Problems ◽  
Graph Coloring Problem ◽  
Np Hard Problem ◽  
The Right

The graph coloring problem (GCP) is one of the most interesting classical combinatorial optimization problems in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. In this article, the authors propose a new enhanced binary dragonfly algorithm to solve the graph coloring problem. The binary dragonfly algorithm has been enhanced by introducing two modifications. First, the authors use the Gaussian distribution random selection method for choosing the right value of the inertia weight w used to update the step vector (∆X). Second, the authors adopt chaotic maps to determine the random parameters s, a, c, f, and e. The aim of these modifications is to improve the performance and the efficiency of the binary dragonfly algorithm and ensure the diversity of solutions. The authors consider the well-known DIMACS benchmark graph coloring instances to evaluate the performance of their algorithm. The simulation results reveal the effectiveness and the successfulness of the proposed algorithm in comparison with some well-known algorithms in the literature.

scholarly journals A Self-Adaptive Cuckoo Search Algorithm Using a Machine Learning Technique

Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1840
Author(s):  
Nicolás Caselli ◽  
Ricardo Soto ◽  
Broderick Crawford ◽  
Sergio Valdivia ◽  
Rodrigo Olivares
Keyword(s):  
Machine Learning ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Parameter Configuration ◽  
Self Tuning ◽  
Problem Solvers

Metaheuristics are intelligent problem-solvers that have been very efficient in solving huge optimization problems for more than two decades. However, the main drawback of these solvers is the need for problem-dependent and complex parameter setting in order to reach good results. This paper presents a new cuckoo search algorithm able to self-adapt its configuration, particularly its population and the abandon probability. The self-tuning process is governed by using machine learning, where cluster analysis is employed to autonomously and properly compute the number of agents needed at each step of the solving process. The goal is to efficiently explore the space of possible solutions while alleviating human effort in parameter configuration. We illustrate interesting experimental results on the well-known set covering problem, where the proposed approach is able to compete against various state-of-the-art algorithms, achieving better results in one single run versus 20 different configurations. In addition, the result obtained is compared with similar hybrid bio-inspired algorithms illustrating interesting results for this proposal.

Economic Load Dispatch With Multiple Fuel Options and Valve Point Effect Using Cuckoo Search Algorithm With Different Distributions

2020 ◽  
Vol 9 (3) ◽  
pp. 24-38
Author(s):  
Cuong Dinh Tran ◽  
Tam Thanh Dao ◽  
Ve Song Vo
Keyword(s):  
Random Walk ◽  
Heuristic Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Cauchy Distribution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Natural Phenomenon ◽  
Economic Load Dispatch ◽  
Valve Point Effect

The cuckoo search algorithm (CSA), a new meta-heuristic algorithm based on natural phenomenon of the cuckoo species and Lévy flights random walk has been widely and successfully applied to several optimization problems so far. In the article, two modified versions of CSA, where new solutions are generated using two distributions including Gaussian and Cauchy distributions in addition to imposing bound by best solutions mechanisms are proposed for solving economic load dispatch (ELD) problems with multiple fuel options. The advantages of CSA with Gaussian distribution (CSA-Gauss) and CSA with Cauchy distribution (CSA-Cauchy) over CSA with Lévy distribution and other meta-heuristic are fewer parameters. The proposed CSA methods are tested on two systems with several load cases and obtained results are compared to other methods. The result comparisons have shown that the proposed methods are highly effective for solving ELD problem with multiple fuel options and/nor valve point effect.

Reliability Optimization of Complex Systems Using Cuckoo Search Algorithm

2017 ◽  
pp. 94-110 ◽  
Author(s):  
Anuj Kumar ◽  
Sangeeta Pant ◽  
S. B. Singh
Keyword(s):  
Complex Systems ◽  
Life Support ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Reliability Optimization ◽  
Space Capsule ◽  
Metaheuristic Techniques

In this chapter, authors briefly discussed about the classification of reliability optimization problems and their nature. Background of reliability and optimization has also been provided separately so that one can clearly understand the basic terminology used in the field of reliability optimization. Classification of various optimization techniques have also been discussed by the authors. Few metaheuristic techniques related to reliability optimization problems like Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been discussed in brief. Thereafter, authors have discussed about Cuckoo Search Algorithm (CSA) which is the main focus of this chapter. Finally, Cuckoo Search Algorithm has been applied for solving reliability optimization problems of two complex systems namely complex bridge system and life support system in space capsule. Simulation results and conclusion have been presented in the last followed by the references.

Sign in / Sign up

Export Citation Format

Share Document