An improved bacterial colony chemotaxis multi-objective optimisation algorithm

  • Authors:
  • Qing-shan Zhao;Yu-lan Hu;Yun Tian

  • Affiliations:
  • Department of Computer Science and Technology, Xinzhou Teachers University, Xinzhou, Shanxi Province, 034000, China;Department of Computer Science and Technology, Xinzhou Teachers University, Xinzhou, Shanxi Province, 034000, China;Department of Computer Science and Technology, Xinzhou Teachers University, Xinzhou, Shanxi Province, 034000, China

  • Venue:
  • International Journal of Computing Science and Mathematics
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on the multi-objective optimisation problem MOOP. To improve the convergence speed and diversity of bacterial chemotaxis multi-objective optimisation algorithm BCMOA and overcome the defects of escape from local minimum, this paper proposes an improved bacterial colony chemotaxis multi-objective optimisation algorithm IBCCMOA. Firstly, fast non-dominated sorting approach is used to initialise the position of all the bacterias. Secondly, colony intelligent optimisation thought is adopted. Thirdly, a strategy of elite reserve is applied to avoid abandoning the points that the original position is good. Experimental results show that the convergence and diversity solutions of the proposed algorithm are better than that of the existing BCMOA.