Minimum vertex cover problem is a combinatorial optimization problem, it has a wide application in the real world, and it is a NP-hard problem. This paper presented a hybrid chemical reaction optimization algorithm for the minimum vertex cover problem. First of all, according to the undirected graph adjacency matrix, it designed chemical reactions molecular coding and the objective function. At the same time, it blended the greedy algorithm thought creatively into the four important operator of chemical reaction optimization algorithm to speed up the search process of local optimal solution. A...
