Please use this identifier to cite or link to this item:
http://dspace.aiub.edu:8080/jspui/handle/123456789/2470
Title: | Emission and Valve Point Loading Cost Using Superiority of Feasible Solutions-Moth Flame Optimization |
Authors: | Alam, Mohammad Khurshed Sulaiman, Mohd Herwan, Sayem, Md. Shaoran Imtiaz, Shahriar Ringku, Md Mahfuzer Akter Khan, Rahat |
Keywords: | Superiority of Feasible Solutions-Moth Flame Optimization, Valve-point Effect, Optimal Power Flow, Energy Efficiency, and power system optimization |
Issue Date: | 23-May-2023 |
Publisher: | 2023 International Conference on Electrical, Computer and Communication Engineering (ECCE), Chittagong, Bangladesh, 2023 |
Abstract: | The optimal power flow (OPF) the most crucial instrument for power facility design and performance is analysis, load scheduling, and cost-effective dispatch. To determine the evidence of a steady state for a power system network, an optimal power flow analysis is required. This study introduces a novel optimization method called Superiority of Feasible Solutions-Moth Flame Optimization (SH-MFO) to answer the optimal power flow problem. As part of the MATLAB development, SH-MFO is implemented on the IEEE-30 bus standard experiment structure network. When compared to the reliable outcomes produced by other algorithms, the current study employing SH-MFO estimates a Generation and Emission Costs $ 48.6827 $/h for minimizing the different fuels, which ultimately proves to be the best value. Analyze the poorest options suggested by the comparison algorithm, it saves money by 0.9873 % per hour. Based on simulation results, the SH-MFO method provides an improved and effective optimization algorithm for optimal power flow problems. |
Description: | NA |
URI: | http://dspace.aiub.edu:8080/jspui/handle/123456789/2470 |
Appears in Collections: | Publications From Faculty of Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Dr Khurshed 3rd ECCE Cht.docx | 2.93 MB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.