Algorithm of improved marriage in honey bees optimization and convergence analysis

Chen Guang Yang*, Tao Cai, Xu Yan Tu

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

1 引用 (Scopus)

摘要

One problem of marriage in honey bees optimization (MBO) is that its complex computation process will limit its applications. The paper proposed an improved marriage honey bees optimization (IMBO). By randomly initializing drones and restricting the condition of iteration, the calculation process becomes easier. The global convergence characteristic of IMBO is also proved based on the Markov chain theory. With different number of nodes, traveling salesman problem(TSP) is used to compare the IMBO with MBO and genetic algorithm(GA). Simulation results show that IMBO has better convergence performance.

源语言英语
页(从-至)80-84
页数5
期刊Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
27
SUPPL. 1
出版状态已出版 - 5月 2007

指纹

探究 'Algorithm of improved marriage in honey bees optimization and convergence analysis' 的科研主题。它们共同构成独一无二的指纹。

引用此