Issue |
MATEC Web Conf.
Volume 214, 2018
2018 2nd International Conference on Information Processing and Control Engineering (ICIPCE 2018)
|
|
---|---|---|
Article Number | 03007 | |
Number of page(s) | 6 | |
Section | Electronic Information Technology and Control Engineering | |
DOI | https://doi.org/10.1051/matecconf/201821403007 | |
Published online | 15 October 2018 |
Economic Dispatch Solution Using Moth-Flame Optimization Algorithm
1
Faculty of Electrical & Electronics Engineering, Universiti Malaysia Pahang, 26600 Pekan Pahang, Malaysia
2
Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, 26300 Gambang Pahang, Malaysia
This paper proposes an application of a recent nature inspired optimization technique namely Moth-Flame Optimization (MFO) algorithm in solving the Economic Dispatch (ED) problem. In this paper, the practical constraints will be included in determining the minimum cost of power generation such as ramp rate limits, prohibited operating zones and generators operating limits. To show the effectiveness of proposed algorithm, two case systems are used: 6-units and 15-units systems and then the performance of MFO is compared with other techniques from literature. The results show that MFO is able to obtain less total cost than those other algorithms.
© The Authors, published by EDP Sciences, 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.