A Multiobjective Optimization Algorithm Based on Discrete Bacterial Colony Chemotaxis

Abstract EN

Bacterial colony chemotaxis algorithm was originally developed for optimal problem with continuous space.

In this paper the discrete bacterial colony chemotaxis (DBCC) algorithm is developed to solve multiobjective optimization problems.

The basic DBCC algorithm has the disadvantage of being trapped into the local minimum.

Therefore, some improvements are adopted in the new algorithm, such as adding chaos transfer mechanism when the bacterium choose their next locations and the crowding distance operation to maintain the population diversity in the Pareto Front.

The definition of chaos transfer mechanism is used to retain the elite solution produced during the operation, and the definition of crowding distance is used to guide the bacteria for determinate variation, thus enabling the algorithm obtain well-distributed solution in the Pareto optimal set.

The convergence properties of the DBCC strategy are tested on some test functions.

At last, some numerical results are given to demonstrate the effectiveness of the results obtained by the new algorithm.