Algorithm of improved marriage in honey bees optimization and convergence analysis

Chen Guang Yang*, Tao Cai, Xu Yan Tu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)80-84
Number of pages5
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume27
Issue numberSUPPL. 1
Publication statusPublished - May 2007

Keywords

  • Improved marriage in honey bees optimization (IMBO)
  • Markov chain
  • Marriage in honey bees optimization (MBO)
  • Traveling salesman problem (TSP)

Fingerprint

Dive into the research topics of 'Algorithm of improved marriage in honey bees optimization and convergence analysis'. Together they form a unique fingerprint.

Cite this