A Scalable D Dominant Strategy to Solve Large-Dimensional Multi-Objective Optimization Problems

Qiong Yuan; Guang Ming Dai

doi:10.4028/www.scientific.net/AMR.1037.383

Paper Titles

Layout Optimization for Deformable Trimaran Based on BP Neural Network
p.363

Research of the Interpolation Method Applied to the Numerical Simulation of the Casting Filling Process
p.369

Robust Inland Waterway Ship Tracking via Hybrid TLD and Kalman Filter
p.373

A Simaplied Adaptive Kalman Filtering Algorithm
p.378

A Scalable D Dominant Strategy to Solve Large-Dimensional Multi-Objective Optimization Problems
p.383

Using the Improved Genetic BP Neural Network Algorithm for Lithologic Identification
p.389

Applications of Color Morphology in Image Denoising
p.393

A Hierarchical Feature Selection Method Based on Classification Tree for HGU Fault Diagnosis
p.398

BP Neural Network Based Optimization for China Railway Freight Transport Network
p.404

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 1037A Scalable D Dominant Strategy to Solve...

A Scalable D Dominant Strategy to Solve Large-Dimensional Multi-Objective Optimization Problems

Abstract:

Solving large-dimensional multi-objective optimization problems is one of the focus research areas of multi-objective optimization evolutionary . When using traditional multi-objective optimization algorithms to solve large-dimensional multi-objective optimization problems,we found that the unsatisfactory optimizing results often exist. To overcome this flaw, in this paper we studied scalable dominant mechanism and proposed a D dominant strategy. According to the superior theory of D strategy ,we improved the current four kinds of typical multi-objective optimization evolutionary algorithms. The numerical comparison test on DTLZ1-6 (20) questions which were solved by the improved algorithms indicated that D strategy had in varying degrees improved the algorithms for solving large-dimensional multi-objective optimization problems .Thus ,we confirmed that the D strategy for solving large-dimensional multi-objective optimization problems is effective.

You might also be interested in these eBooks

Development of Applied Engineering Sciences

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 1037)

Pages:

383-388

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.1037.383

Citation:

Cite this paper

Online since:

October 2014

Authors:

Qiong Yuan*, Guang Ming Dai

Keywords:

D Dominant Strategy, E Dominant, Large-Dimensional Multi-Objective Optimization Problems

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Deb K, Pratap A , Agarwal S, etal . A tast and elitist multiobjective genetic algorithm: NSGA-II[J] . IEEE Transactions on Evolutionary Computation, 2002 , 6(2): 182-197.

DOI: 10.1109/4235.996017

Google Scholar

[2] Nebro A J , Luna F, Alba E, etal. AbYSS: Adapting scatter search to multiobjective optimization[J]. IEEE Transactions on Evolutionary Computation, 2008 , 12(4): 439-457.

DOI: 10.1109/tevc.2007.913109

Google Scholar

[3] Niu Y, Shen L. The Optimal Multi-objective Optimization Using PSO in Blind Color Image Fusion[C] . International Conference on Multimedia and Ubiquitous Engineering . 2007: 970-975.

DOI: 10.1109/mue.2007.204

Google Scholar

[4] Nebro A , Durillo J , Luna F, etal . MOCell: A cellular genetic algorithm for multiobjective optimization[J]. International Journal of Intelligent Systems, 2009, 24(7): 726-746.

DOI: 10.1002/int.20358

Google Scholar

[5] Deb K, Thiele L, Laumanns M, etal. Scalable multi-objective optimization test problems[J]. Cec'02: Proceedings of the 2002 Congress on Evolutionary Computation, Vols 1 and 2, 2002, 825-830.

DOI: 10.1109/cec.2002.1007032

Google Scholar