In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

This paper presents a new hybrid evolutionary algorithm to solve multi-objective multicast routing problems in telecommunication networks. The algorithm combines simulated annealing strategies and genetic local search, aiming at a more flexible and effective exploration and exploitation in the search space of the complex problem to find more non-dominated solutions in the Pareto Front. Due to t...

The graph coloring problem is an NP-hard problem. Currently, one of the most effective methods to solve this a hybrid evolutionary algorithm. This paper proposes algorithm NERS_HEAD with new elite replacement strategy. In NERS_HEAD, method detect local optimal state proposed so that process can jump out by introducing diversity on time; structure and strategy are designed increase population ev...