Novel multi-objective genetic algorithm based on static bayesian game strategy

  • Authors:
  • Zhiyong Li;Dong Chen;Ahmed Sallam;Li Zhao

  • Affiliations:
  • School of Computer and Communication, Hunan University, Changsha, P.R China;School of Computer and Communication, Hunan University, Changsha, P.R China;School of Computer and Communication, Hunan University, Changsha, P.R China;School of Computer and Communication, Hunan University, Changsha, P.R China

  • Venue:
  • ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multi-objective evolutionary algorithms (MOEAs) have been the mainstream to solve multi-objectives optimization problems In this paper we add the static Bayesian game strategy into MOGA and propose a novel multi-objective genetic algorithm(SBG-MOGA) Conventional MOGAs use non-dominated sorting methods to push the population to move toward the real Pareto front This approach has a good performance at earlier stages of the evolution, however it becomes hypodynamic at the later stages In SBG-MOGA the objectives to be optimized are similar to players in a static Bayesian game A player is a rational person who has his own strategy space A player selects a strategy and takes an action to realize his strategy in order to achieve the maximal income for the objective he works on The game strategy will generate a tensile force over the population and this will obtain a better multi-objective optimization performance Moreover, the algorithm is verified by several simulation experiments and its performance is tested by different benchmark functions.