Solving multi-area environmental economic dispatch by Pareto-based chemical-reaction optimization algorithm

In this study, we present a Pareto-based chemical-reaction optimization ( PCRO ) algorithm for solving the multi-area environmental/ economic dispatch optimization problems. Two objectives are minimized simultaneously, i.e., total fuel cost and emission. In the proposed algorithm, each solution is r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/CAA journal of automatica sinica 2019-09, Vol.6 (5), p.1240-1250
Hauptverfasser: Li, Junqing, Sang, Hongyan, Pan, Quanke, Duan, Peiyong, Gao, Kaizhou
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this study, we present a Pareto-based chemical-reaction optimization ( PCRO ) algorithm for solving the multi-area environmental/ economic dispatch optimization problems. Two objectives are minimized simultaneously, i.e., total fuel cost and emission. In the proposed algorithm, each solution is represented by a chemical molecule. A novel encoding mechanism for solving the multi-area environmental/ economic dispatch optimization problems is designed to dynamically enhance the performance of the proposed algorithm. Then, an ensemble of effective neighborhood approaches is developed, and a self-adaptive neighborhood structure selection mechanism is also embedded in PCRO to increase the search ability while maintaining population diversity. In addition, a grid-based crowding distance strategy is introduced, which can obviously enable the algorithm to easily converge near the Pareto front. Furthermore, a kinetic-energy-based search procedure is developed to enhance the global search ability. Finally, the proposed algorithm is tested on sets of the instances that are generated based on realistic production. Through the analysis of experimental results, the highly effective performance of the proposed PCRO algorithm is favorably compared with several algorithms, with regards to both solution quality and diversity.
ISSN:2329-9266
2329-9274
DOI:10.1109/JAS.2017.7510454