COMBINATION ALGORITHM OF THE NELDER-MEAD MARRIAGE BEES OPTIMIZATION AND ITS CONVERGENCE ANALYSIS AND PERFORMANCE COMPITATION

摘要：

Marriage in Honey Bees Optimization (MBO) is a new swarm-intelligence method, but it has the shortcomings of low speed and complex computation process. By changing the structure of MBO and utilizing the Nelder-Mead method to perform the local characteristic, we propose a new optimization algorithm. The global convergence characteristic of the proposed algorithm is proved by using the Markov Chain theory. And then some simulations are done on Traveling Salesman Problem (TSP) and several public evaluation functions. Comparing the proposed algorithm with MBO, Improved MBO (IMBO) and Genetic Algorithm (GA), simulation results show that the proposed algorithm has better convergence performance.

关键词： Marriage in honey bees optimization (MBO) Nelder-Mead Method Markov chain Nelder-Mead Marriage in Honey Bees Optimization (NMMBO) Traveling Salesman Problem (TSP)

作者: Chenguang Yang Jie Chen Xuyan Tu

作者单位: Systems Engineering Research Institute,China State Shipbuilding Corporation,Beijing 100036,P.R.China Department of Automation,School of Information Science and Technology,Beijing Institute of Technolog Department of Automation,School of Information Science and Technology,Beijing Institute of Technolog

会议类型: 国际会议

会议名称: 2008年拟人系统国际会议(2008 International Conference on Humanized Systems )(ICHS’08)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-18（万方平台首次上网日期，不代表论文的发表时间）