Economic Emission Load Dispatch Problem with Valve-Point Loading Using a Novel Quasi-Oppositional-Based Political Optimizer

In the present paper, a novel meta-heuristic algorithm, namely quasi-oppositional search-based political optimizer (QOPO), is proposed to solve a non-convex single and bi-objective economic and emission load dispatch problem (EELDP). In the proposed QOPO technique, an opposite estimate candidate sol...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Vedik Basetti, Shriram S. Rangarajan, Chandan Kumar Shiva, Harish Pulluri, Ritesh Kumar, Randolph E. Collins, Tomonobu Senjyu
Formato: article
Lenguaje:EN
Publicado: MDPI AG 2021
Materias:
Acceso en línea:https://doaj.org/article/c5dc3132cd374a63ae0dc88d68426d52
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:In the present paper, a novel meta-heuristic algorithm, namely quasi-oppositional search-based political optimizer (QOPO), is proposed to solve a non-convex single and bi-objective economic and emission load dispatch problem (EELDP). In the proposed QOPO technique, an opposite estimate candidate solution is performed simultaneously on each candidate solution of the political optimizer to find a better solution of EELDP. In the bi-objective EELDP, QOPSO is applied to simultaneously minimize fuel costs and emissions by considering various constraints such as the valve-point loading effect (VPLE) and generator limits for a generation. The effectiveness of the proposed QOPO technique has been applied on three units, six units, 10-units, 11-units, 13-units, and 40-unit systems by considering the VPLE, transmission line losses, and generator limits. The results obtained using the proposed QOPO are compared with those obtained by other techniques reported in the literature. The relative results divulge that the proposed QOPO technique has a good exploration and exploitation capability to determine the optimal global solution compared to the other methods provided in the literature without violation of any constraints and bounded limits.