The Journal of China Universities of Posts and Telecommunications ›› 2019, Vol. 26 ›› Issue (5): 11-21.doi: 10.19682/j.cnki.1005-8885.2019.0021

Previous Articles     Next Articles

Self-adaptive mechanism based genetic algorithms for combinatorial optimization problems

Qu Zhijian , Wang Shasha, Xu Hongbo, Li Panjing, Li Caihong   

  • Received:2018-11-14 Revised:2019-04-09 Online:2019-10-31 Published:2019-11-06
  • Contact: Zhi-Jian QU E-mail:handuhandu@163.com
  • Supported by:
    National Natural Science Foundation of China

Abstract: To improve the evolutionary algorithm performance, especially in convergence speed and global optimization ability, a self-adaptive mechanism is designed both for the conventional genetic algorithm (CGA) and the quantum inspired genetic algorithm (QIGA). For the self-adaptive mechanism, each individual was assigned with suitable evolutionary parameter according to its current evolutionary state. Therefore, each individual can evolve toward to the currently best solution. Moreover, to reduce the running time of the proposed self-adaptive mechanism based QIGA (SAM-QIGA), a multi-universe parallel structure was employed in the paper. Simulation results show that the proposed SAM-QIGA have better performances both in convergence and global optimization ability.

Key words: combinatorial optimization, self-adaptive, genetic algorithm, multi-universe parallel