• DocumentCode
    1639856
  • Title

    An orthogonal multi-objective evolutionary algorithm with lower-dimensional crossover

  • Author

    Gao, Song ; Sanyou Zeng ; Xiao, Bo ; Zhang, Lei ; Shi, Yulong ; Tian, Xin ; Yang, Yang ; Long, Haoqiu ; Yang, Xianqiang ; Yu, Danping ; Yan, Zu

  • Author_Institution
    Sch. of Comput. Sci., China Univ. of Geosci., Wuhan
  • fYear
    2009
  • Firstpage
    1959
  • Lastpage
    1964
  • Abstract
    This paper proposes an multi-objective evolutionary algorithm. The algorithm is based on OMOEA-II. A new linear breeding operator with lower-dimensional crossover and copy operation is used. By using the lower-dimensional crossover, the complexity of searching is decreased so the algorithm converges faster. The orthogonal crossover increase probability of producing potential superior solutions, which helps the algorithm get better results. Ten unconstrained problems are used to test the algorithm. For three problems, the obtained solutions are very close to the true Pareto front, and for one problem, the obtained solutions distribute on part of the true Pareto front.
  • Keywords
    Pareto optimisation; evolutionary computation; lower-dimensional crossover; orthogonal multiobjective evolutionary algorithm; searching complexity; true Pareto front; Algorithm design and analysis; Computer science; Design methodology; Evolutionary computation; Genetic algorithms; Geology; Robustness; Sorting; Space technology; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2009. CEC '09. IEEE Congress on
  • Conference_Location
    Trondheim
  • Print_ISBN
    978-1-4244-2958-5
  • Electronic_ISBN
    978-1-4244-2959-2
  • Type

    conf

  • DOI
    10.1109/CEC.2009.4983180
  • Filename
    4983180