Front-based yin-yang-pair optimization and its performance on CEC2009 benchmark problems

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Front-based Yin-Yang-Pair Optimization (F-YYPO) is a novel meta-heuristic for multi-objective problems that works with multiple Yin-Yang pair of points to handle conflicting objectives and utilizes the non-dominance-based approach to sort points into fronts. The performance of F-YYPO along with that of Multi-Objective Differential Evolution with Ranking-based Mutation Operator, Multi-Objective Grey Wolf Optimizer, and Non-dominance Sorting Genetic Algorithm-II is benchmarked on a suite of ten multi-objective problems. A comparative analysis between the performances of these algorithms is obtained by utilizing nonparametric statistical tests for multiple comparisons. F-YYPO is observed to outperform the competing algorithms on the benchmark problems with regard to the quality of solutions and computational time.

Cite

CITATION STYLE

APA

Punnathanam, V., & Kotecha, P. (2019). Front-based yin-yang-pair optimization and its performance on CEC2009 benchmark problems. In Advances in Intelligent Systems and Computing (Vol. 669, pp. 387–397). Springer Verlag. https://doi.org/10.1007/978-981-10-8968-8_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free