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 language | English |
---|---|
Pages (from-to) | 80-84 |
Number of pages | 5 |
Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
Volume | 27 |
Issue number | SUPPL. 1 |
Publication status | Published - May 2007 |
Keywords
- Improved marriage in honey bees optimization (IMBO)
- Markov chain
- Marriage in honey bees optimization (MBO)
- Traveling salesman problem (TSP)