Diversification-driven Memetic Algorithm for the Maximum Diversity Problem
2018 5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)(2018)
摘要
The maximum diversity problem (MDP) is a classic NP-hard optimization problem with a number of applications. We propose in this work an effective hybrid evolutionary algorithm for MDP called the diversification-driven memetic algorithm by introducing a diversification mechanism into an existing memetic algorithm. Computational results on 20 representative benchmark instances show that the proposed algorithm outperforms the state-of-the-art MDP algorithms in the literature, indicating the interest of the diversification mechanism within the proposed memetic algorithm.
更多查看译文
关键词
Maximum diversity problem,tabu search,memetic algorithm,diversification
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络