Multi-objective gravitational search algorithm based on decomposition
CSTR:
Author:
Affiliation:

(1.College of Information and Communication Engineering, Harbin Engineering University, 150001 Harbin, China; 2. College of Information Engineering, Northeast Dianli University, 132001 Jilin, Jilin, China; 3. Dept. of Information Engineering, Liaoning Provincial College of Communications, 110122 Shenyang, China)

Clc Number:

TP18

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    When the ideal frontier is discontinuous or inhomogeneous, the multi-objective evolutionary algorithm can’t solve multi-objective problems effectively by decomposition. In order to improve this situation, a novel multi-objective gravitational search algorithm based on decomposition (MOGSA/D) is proposed. In MOGSA/D, the multi-population serial strategy is good for the population study evolutionary information. According to shape prediction of ideal frontier, a suitable generation method of weight coefficient is selected. A pruning strategy is adopted to prune the solution set. Experimental results show that MOGSA has a good performance to solve multi-objective problems in comparison with other multi-objective optimization algorithms.

    Reference
    Related
    Cited by
Get Citation
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 30,2014
  • Revised:
  • Adopted:
  • Online: November 24,2015
  • Published:
Article QR Code