• DocumentCode
    985252
  • Title

    Incremental multiple objective genetic algorithms

  • Author

    Chen, Qian ; Guan, Sheng-Uei

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore
  • Volume
    34
  • Issue
    3
  • fYear
    2004
  • fDate
    6/1/2004 12:00:00 AM
  • Firstpage
    1325
  • Lastpage
    1334
  • Abstract
    This paper presents a new genetic algorithm approach to multiobjective optimization problems-incremental multiple objective genetic algorithms (IMOGA). Different from conventional MOGA methods, it takes each objective into consideration incrementally. The whole evolution is divided into as many phases as the number of objectives, and one more objective is considered in each phase. Each phase is composed of two stages. First, an independent population is evolved to optimize one specific objective. Second, the better-performing individuals from the single-objective population evolved in the above stage and the multiobjective population evolved in the last phase are joined together by the operation of integration. The resulting population then becomes an initial multiobjective population, to which a multiobjective evolution based on the incremented objective set is applied. The experiment results show that, in most problems, the performance of IMOGA is better than that of three other MOGAs, NSGA-II, SPEA, and PAES. IMOGA can find more solutions during the same time span, and the quality of solutions is better.
  • Keywords
    genetic algorithms; problem solving; incremental problem solving; independent population; multiple objective genetic algorithm; single-objective population; vector optimization; Genetic algorithms; Legged locomotion; Optimization methods; Problem-solving; Algorithms; Artificial Intelligence; Decision Support Techniques; Numerical Analysis, Computer-Assisted; Systems Theory;
  • fLanguage
    English
  • Journal_Title
    Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1083-4419
  • Type

    jour

  • DOI
    10.1109/TSMCB.2003.822958
  • Filename
    1298883