Multi-objective bacterial foraging optimization

被引:67
作者
Niu, Ben [1 ,2 ,3 ]
Wang, Hong [1 ]
Wang, Jingwen [1 ]
Tan, Lijing [4 ]
机构
[1] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China
[2] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei 230031, Peoples R China
[3] Univ Hong Kong, E Business Technol Inst, Hong Kong, Hong Kong, Peoples R China
[4] Jinan Univ, Coll Management, Guangzhou, Guangdong, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Multi-objective optimization; Bacterial Foraging Optimization; Health sorting approach; Pareto dominance mechanism; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHM;
D O I
10.1016/j.neucom.2012.01.044
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes a novel Bacterial Foraging Optimization (BFO) approach to multi-objective optimization, called Multi-objective Bacterial Foraging Optimization (MBFO). The objectives in the Multi-objective Bacterial Foraging Optimization are maintained by a fitness survive mechanism. Bacteria with the smaller health values have the better chance to survive. Meanwhile, the main goal of multi-objective optimization problems is to obtain a superior non-dominated front which is closed to the true Pareto front. With identification of such features, the idea of integration between health sorting approach and pareto dominance mechanism are developed to search for Pareto-optimal set of problems. Moreover, strategy keeping a certain unfeasible border solutions based on a given probability is considered to improve the diversity of individuals. In addition, two different performance metrics: Diversity and Generational Distance are introduced as well to evaluate multi-objective optimization problems. Compared to two other multi-objective optimization evolutionary algorithms MOPSO and NSGA-II, simulation results show that in most cases, the proposed MBFO is able to find a much better spread of solutions and convergence to the true Pareto-optimal front faster. It suggests that MBFO is very promising in dealing with ordinary multi-objective optimization problems. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:336 / 345
页数:10
相关论文
共 31 条
  • [1] [Anonymous], P 2002 UK WORKSH COM
  • [2] Bo Yang, 2007, 2007 IEEE International Conference on Control and Automation, ICCA 2007, P166, DOI 10.1109/ICCA.2007.4376340
  • [3] Evolutionary optimization of radial basis function classifiers for data mining applications
    Buchtala, O
    Klimek, M
    Sick, B
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2005, 35 (05): : 928 - 947
  • [4] Chen T., 2007, 2 INT C INNOVATIVE C, P391, DOI [10.1109/ICICIC.2007.67, DOI 10.1109/ICICIC.2007.67]
  • [5] A Fast Bacterial Swarming Algorithm For High-dimensional Function Optimization
    Chu, Ying
    Mi, Hua
    Liao, Huilian
    Ji, Zhen
    Wu, Q. H.
    [J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 3135 - +
  • [6] On Stability of the Chemotactic Dynamics in Bacterial-Foraging Optimization Algorithm
    Das, Swagatam
    Dasgupta, Sambarta
    Biswas, Arijit
    Abraham, Ajith
    Konar, Amit
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (03): : 670 - 679
  • [7] Adaptive computational chemotaxis in bacterial foraging algorithm
    Dasgupta, Sarabarta
    Biswas, Arijit
    Abraham, Ajith
    Das, Swagatam
    [J]. CISIS 2008: THE SECOND INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, PROCEEDINGS, 2008, : 64 - +
  • [8] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [9] Deb K, 2001, WIL INT S SYS OPT, V16
  • [10] Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
    Deb, Kalyanmoy
    [J]. EVOLUTIONARY COMPUTATION, 1999, 7 (03) : 205 - 230