|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 130 - Issue 9 |
| Published: November 2015 |
| Authors: P. Paramasivan, R.K. Santhi |
10.5120/ijca2015907113
|
P. Paramasivan, R.K. Santhi . Non-Dominated Sorting Flower Pollination Algorithm for Dynamic Economic Emission Dispatch. International Journal of Computer Applications. 130, 9 (November 2015), 19-26. DOI=10.5120/ijca2015907113
@article{ 10.5120/ijca2015907113,
author = { P. Paramasivan,R.K. Santhi },
title = { Non-Dominated Sorting Flower Pollination Algorithm for Dynamic Economic Emission Dispatch },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 130 },
number = { 9 },
pages = { 19-26 },
doi = { 10.5120/ijca2015907113 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A P. Paramasivan
%A R.K. Santhi
%T Non-Dominated Sorting Flower Pollination Algorithm for Dynamic Economic Emission Dispatch%T
%J International Journal of Computer Applications
%V 130
%N 9
%P 19-26
%R 10.5120/ijca2015907113
%I Foundation of Computer Science (FCS), NY, USA
This paper presents a non-dominated sorting flower pollination algorithm for dynamic economic emission dispatch (DEED) problem. Non-dominated sorting flower pollination algorithm is designed to construct the pareto optimal front and a fuzzy techniques extracts the best compromised solution of DEED. Results two standard of test systems are presented to exhibit its superior performance.