期刊
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION
卷 7, 期 3, 页码 183-194出版社
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/IJBIC.2015.069554
关键词
graph colouring problem; GCP; cuckoo search algorithm; quantum computing; heuristics; hybrid algorithms
The graph colouring problem (GCP) is one of the most interesting, studied and difficult combinatorial optimisation problems. That is why, several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics and hybrid approaches. In this paper, we try to solve the graph colouring problem using a new approach based on the quantum inspired cuckoo search algorithm. The first contribution consists in defining an appropriate quantum representation based on qubit representation to represent the graph colouring solutions. The second contribution is the proposition of a novel measure operator based on the adjacency matrix. The third contribution involves the proposition of an adapted hybrid quantum mutation operation. To show the feasibility and the effectiveness of the algorithm, we have used the standard DIMACS benchmark, and the obtained results are very encouraging.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据