Hybrid Non-Dominated Sorting Genetic Algorithm With Adaptive Operators Selection
![](/xmlui/themes/Mirage2//images/mime2.png)
Tarih
2017Yazar
Mashwani, Wali Khan
Salhi, Abdellah
Yeniay, Ozgur
Hussian, H.
Jan, M. A.
Üst veri
Tüm öğe kaydını gösterÖzet
Multiobjective optimization entails minimizing or maximizing multiple objective functions subject to a set of constraints. Many real world applications can be formulated as multi-objective optimization problems (MOPs), which often involve multiple conflicting objectives to be optimized simultaneously. Recently, a number of multi-objective evolutionary algorithms (MOEAs) were developed suggested for these MOPs as they do not require problem specific information. They find a set of non-dominated solutions in a single run. The evolutionary process on which they are based, typically relies on a single genetic operator. Here, we suggest an algorithm which uses a basket of search operators. This is because it is never easy to choose the most suitable operator for a given problem. The novel hybrid non-dominated sorting genetic algorithm (HNSGA) introduced here in this paper and tested on the ZDT (Zitzler-Deb-Thiele) and CEC'09 (2009 IEEE Conference on Evolutionary Computations) benchmark problems specifically formulated for MOEAs. Numerical results prove that the proposed algorithm is competitive with state-of-the-art MOEAs. (C) 2017 Elsevier B.V. All rights reserved.