Khalil Muhammad Ilyas Khan, Rahman Izaz Ur, Zakarya Muhammad, Zia Ashraf, Khan Ayaz Ali, Qazani Mohammad Reza Chalak, Al-Bahri Mahmood, Haleem Muhammad
Department of Computer Science, Abdul Wali Khan University, Mardan, Pakistan.
Faculty of Computing and Information Technology, Sohar University, Sohar, Oman.
Sci Rep. 2024 Jun 11;14(1):13418. doi: 10.1038/s41598-024-62904-4.
This work implements the recently developed nth state Markovian jumping particle swarm optimisation (PSO) algorithm with local search (NS-MJPSOloc) awareness method to address the economic/environmental dispatch (EED) problem. The proposed approach, known as the Non-dominated Sorting Multi-objective PSO with Local Best (NS-MJPSOloc), aims to enhance the performance of the PSO algorithm in multi-objective optimisation problems. This is achieved by redefining the concept of best local candidates within the search space of multi-objective optimisation. The NS-MJPSOloc algorithm uses an evolutionary factor-based mechanism to identify the optimum compromise solution, a Markov chain state jumping technique to control the Pareto-optimal set size, and a neighbourhood's topology (such as a ring or a star) to determine its size. Economic dispatch refers to the systematic allocation of available power resources in order to fulfill all relevant limitations and effectively meet the demand for electricity at the lowest possible operating cost. As a result of heightened public consciousness regarding environmental pollution and the implementation of clean air amendments, nations worldwide have compelled utilities to adapt their operational practises in order to comply with environmental regulations. The (NS-MJPSOloc) approach has been utilised for resolving the EED problem, including cost and emission objectives that are not commensurable. The findings illustrate the efficacy of the suggested (NS-MJPSOloc) approach in producing a collection of Pareto-optimal solutions that are evenly dispersed within a single iteration. The comparison of several approaches reveals the higher performance of the suggested (NS-MJPSOloc) in terms of the diversity of the Pareto-optimal solutions achieved. In addition, a measure of solution quality based on Pareto optimality has been incorporated. The findings validate the effectiveness of the proposed (NS-MJPSOloc) approach in addressing the multi-objective EED issue and generating a trade-off solution that is both optimal and of high quality. We observed that our approach can reduce 6.4% of fuel costs and 9.1% of computational time in comparison to the classical PSO technique. Furthermore, our method can reduce 9.4% of the emissions measured in tons per hour as compared to the PSO approach.
这项工作采用了最近开发的具有局部搜索(NS-MJPSOloc)感知方法的第n状态马尔可夫跳跃粒子群优化(PSO)算法,以解决经济/环境调度(EED)问题。所提出的方法,即带局部最优的非支配排序多目标PSO(NS-MJPSOloc),旨在提高PSO算法在多目标优化问题中的性能。这是通过在多目标优化的搜索空间内重新定义最佳局部候选解的概念来实现的。NS-MJPSOloc算法使用基于进化因子的机制来确定最优折衷解,采用马尔可夫链状态跳跃技术来控制帕累托最优集的大小,并利用邻域拓扑结构(如环形或星形)来确定其规模。经济调度是指对可用电力资源进行系统分配,以满足所有相关限制,并以尽可能低的运营成本有效满足电力需求。由于公众对环境污染的意识增强以及清洁空气修正案的实施,世界各国迫使公用事业公司调整其运营方式,以遵守环境法规。(NS-MJPSOloc)方法已被用于解决EED问题,包括不可通约的成本和排放目标。研究结果表明,所提出的(NS-MJPSOloc)方法在单次迭代中生成均匀分布的帕累托最优解集方面具有有效性。几种方法的比较表明,所提出的(NS-MJPSOloc)方法在实现的帕累托最优解的多样性方面具有更高的性能。此外,还纳入了基于帕累托最优性的解质量度量。研究结果验证了所提出的(NS-MJPSOloc)方法在解决多目标EED问题和生成最优且高质量的权衡解方面的有效性。我们观察到,与经典PSO技术相比,我们的方法可降低6.4%的燃料成本和9.1%的计算时间。此外,与PSO方法相比,我们的方法可将每小时排放量降低9.4%(以吨为单位)。