• DocumentCode
    2572026
  • Title

    An Spanning Tree based method for pruning non-dominated solutions in multi-objective optimization problems

  • Author

    Li, Miqing ; Zheng, Jinhua ; Li, Ke ; Wu, Jun ; Xiao, Guixia

  • Author_Institution
    Inst. of Inf. Eng., Xiangtan Univ., Hunan, China
  • fYear
    2009
  • fDate
    11-14 Oct. 2009
  • Firstpage
    4882
  • Lastpage
    4887
  • Abstract
    Diversity maintenance of solutions is a crucial part in multi-objective optimization. However, most of existing studies show a good distribution with a large computational load or a comparative bad distribution quickly. In this paper, a method for pruning a set of non-dominated solutions using a spanning tree is proposed. This approach defines a density estimation metric - spanning tree crowding distance (STCD). Moreover, information of degree of solution combined with STCD is employed to truncate the population. From an extensive comparative study with three other methods on a number of 2, 3 and 4 objective test problems, the proposed method indicates a good balance among uniformity, spread and execution time.
  • Keywords
    computational complexity; estimation theory; optimisation; trees (mathematics); computational complexity; density estimation; multiobjective optimization; pruning; spanning tree crowding distance; Computational complexity; Cybernetics; Distributed computing; Evolutionary computation; Genetic algorithms; Operations research; Optimization methods; Testing; Tree graphs; USA Councils; Density estimation; Evolutionary algorithms; Multi-objective optimization; Pruning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on
  • Conference_Location
    San Antonio, TX
  • ISSN
    1062-922X
  • Print_ISBN
    978-1-4244-2793-2
  • Electronic_ISBN
    1062-922X
  • Type

    conf

  • DOI
    10.1109/ICSMC.2009.5346322
  • Filename
    5346322