A Cuckoo Quantum Evolutionary Algorithm for the Graph Coloring Problem
Based on the framework of the quantum-inspired evolutionary algorithm, a cuckoo quantum evolutionary algorithm (CQEA) is proposed for solving the graph coloring problem (GCP). To reduce iterations for the search of the chromatic number, the initial quantum population is generated by random initialization assisted by inheritance. Moreover, improvement of global exploration is achieved by incorporating the cuckoo search strategy, and a local search operation, as well as a perturbance strategy, is developed to enhance its performance on GCPs. Numerical results demonstrate that CQEA operates with strong exploration and exploitation abilities, and is competitive to the compared state-of-the-art heuristic algorithms.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Variations on Memetic Algorithms for Graph Coloring Problems
Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem.The most effective methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms or q…
DiversityPlanning for Compilation of a Quantum Algorithm for Graph Coloring
The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach …
Evolutionary Algorithm for Graph Coloring Problem
The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertices sharing an edge receive the same color…
Evaluation The Efficiency Of Cuckoo Optimization Algorithm
In this paper a new evolutionary algorithm, for continuous nonlinear optimization problems, is surveyed. This method is inspired by the life of a bird, called Cuckoo. The Cuckoo Optimization Algorithm (COA) is evaluated …
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization
Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring proble…
Evolutionary Algorithms