Adaptive bacterial colony chemotaxis multi-objective optimisation algorithm
Summary: This paper focuses on the multi-objective optimisation problem (MOOP). To improve the convergence speed and the diversity of bacterial chemotaxis multi-objective optimisation algorithm (BCMOA) and avoid falling into local minimum, this paper proposes an adaptive bacterial colony chemotaxis multi-objective optimisation (ABCCMO) algorithm. Firstly, fast non-dominated sorting approach is used to initialise the position of all the bacterial. Secondly, this proposed algorithm adopts the adaptive chemotaxis step length. Thirdly, colony intelligent optimisation thought is adopted. Experimental results show that ABCCMO is able to find much better Pareto front solutions.
- A multiobjective optimization algorithm based on discrete bacterial colony chemotaxis
- Bacterial colony optimization
- A novel coupling algorithm based on glowworm swarm optimization and bacterial foraging algorithm for solving multi-objective optimization problems
- scientific article; zbMATH DE number 6671507 (Why is no real title available?)
This page was built for publication: Adaptive bacterial colony chemotaxis multi-objective optimisation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221568)