A Non-Linear-Threshold-Accepting Function Based Algorithm for the Solution of Economic Dispatch Problem

2020 ◽  
Vol 54 (5) ◽  
pp. 1269-1289 ◽  
Author(s):  
Nabil Nahas ◽  
Mohamed Noomane Darghouth ◽  
Mohammed Abouheaf
Keyword(s):  
Economic Dispatch ◽  
Optimization Techniques ◽  
Management Tool ◽  
Total Power ◽  
Computational Time ◽  
Threshold Accepting ◽  
Linear Threshold ◽  
Non Linear ◽  
Economic Dispatch Problem ◽  
Analytical Approaches

This article introduces a novel heuristic algorithm based on Non-Linear Threshold Accepting Function to solve the challenging non-convex economic dispatch problem. Economic dispatch is a power system management tool; it is used to allocate the total power generation to the generating units to meet the active load demand. The power systems are highly nonlinear due to the physical and operational constraints. The complexity of the resulting non-convex objective cost function led to inabilities to solve the problem by using analytical approaches, especially in the case of large-scale problems. Optimization techniques based on heuristics are used to overcome these difficulties. The Non-Linear Threshold Accepting Algorithm has demonstrated efficiency in solving various instances of static and dynamic allocation and scheduling problems but has never been applied to solve the economic dispatch problem. Existing benchmark systems are used to evaluate the performance of the proposed heuristic. Additional random instances with different sizes are generated to compare the adopted heuristic to the Harmony Search and the Whale Optimization Algorithms. The obtained results showed the superiority of the proposed algorithm in finding, for all considered instances, a high-quality solution in minimum computational time.

Non-linear threshold algorithm based solution for the redundancy allocation problem considering multiple redundancy strategies

2019 ◽  
Vol 25 (3) ◽  
pp. 397-411 ◽  
Author(s):  
Nabil Nahas ◽  
Mohamed N. Darghouth ◽  
Abdul Qadar Kara ◽  
Mustapha Nourelfath
Keyword(s):  
Optimization Problem ◽  
Allocation Problem ◽  
Computational Time ◽  
Redundancy Allocation Problem ◽  
Redundancy Allocation ◽  
Content Type ◽  
Linear Threshold ◽  
Subsystem Level ◽  
Non Linear ◽  
Selection Of

Purpose The purpose of this paper is to introduce an efficient algorithm based on a non-linear accepting threshold to solve the redundancy allocation problem (RAP) considering multiple redundancy strategies. In addition to the components reliability, multiple redundancy strategies are simultaneously considered to vary the reliability of the system. The goal is to determine the optimal selection of elements, redundancy levels and redundancy strategy, which maximizes the system reliability under various system-level constraints. Design/methodology/approach The mixed RAP considering the use of active and standby components at the subsystem level belongs to the class of NP-hard problems involving selection of elements and redundancy levels, to maximize a specific system performance under a given set of physical and budget constraints. Generally, the authors recourse to meta-heuristic algorithms to solve this type of optimization problem in a reasonable computational time, especially for large-size problems. A non-linear threshold accepting algorithm (NTAA) is developed to solve the tackled optimization problem. Numerical results for test problems from previous research are reported and analyzed to assess the efficiency of the proposed algorithm. Findings The comparison with the best solutions obtained in previous studies, namely: genetic algorithm, simulated annealing, memetic algorithm and the particle swarm optimization for 33 different instances of the problem, demonstrated the superiority of the proposed algorithm in finding for all considered instances, a high-quality solution in a minimum computational time. Research limitations/implications Considering multiple redundancy strategies helps to achieve higher reliability levels but increases the complexity of the obtained solution leading to infeasible systems in term of physical design. Technological constraints must be integrated into the model to provide a more comprehensive and realistic approach. Practical implications Designing high performant systems which meet customer requirements, under different economic and functional constraints is the main challenge faced by the manufacturers. The proposed algorithm aims to provide a superior solution of the reliability optimization problem by considering the possibility to adopt multiple redundancy strategies at the subsystem level in a minimum computational time. Originality/value A NTAA is expanded to the RAP considering multiple redundancy strategies at the subsystem level subject to weight and cost constraints. A procedure based on a penalized objective function is developed to encourage the algorithm to explore toward the feasible solutions area. By outperforming well-known solving technique, the NTAA provides a powerful tool to reliability designers of complex systems where different varieties of redundancies can be considered to achieve high-reliability systems.

scholarly journals Non-Linear Threshold Algorithm for the Redundancy Optimization of Multi-State Systems

2020 ◽  
Vol 6 (1) ◽  
pp. 416-441
Author(s):  
Nabil Nahas ◽  
Mustapha Nourelfath
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Optimization Problem ◽  
Function Technique ◽  
Computational Time ◽  
System Availability ◽  
Linear Threshold ◽  
Binary State ◽  
Non Linear ◽  
Redundancy Optimization

To improve system performance, redundancy is widely used in different kinds of industrial applications such as power systems, aerospace, electronic, telecommunications and manufacturing systems. Designing high performant systems which meet customer requirements with a minimum cost is a challenging task in these industries. This paper develops an efficient approach for the redundancy optimization problem of series-parallel structures modeled as multi-state systems. To reach the target system availability, redundancies are used for components among a list of products available in the market. Each component is characterized by its own availability, cost and performance. The goal is to minimize the total cost under a system availability constraint. Discrete levels of performance are considered for the system and its components. The extreme values of such performance levels correspond to perfect functioning and complete failure. A piecewise cumulative load curve represents consumer demand. System availability corresponds to the aptitude to fulfill this demand. The multi-state system availability evaluation uses the universal moment generating function technique. The proposed optimization algorithm is based on the non-linear threshold accepting metaheuristic, while using a self-adjusting penalty guided strategy. The obtained results demonstrate the approach efficiency for solving the redundancy optimization problem of multi-state systems. Its effectiveness is also tested using the classical redundancy optimization problem of binary-state systems. The algorithm is evaluated by comparison to the best known methods. For multi-state systems, it is compared to genetic algorithm and tabu search. For binary-state systems, it is compared to genetic algorithm, tabu search, ant colony optimization and harmony search. The obtained results demonstrate that the proposed approach outperforms these state-of-the-art benchmark methods in finding, for all considered instances, a high-quality solution in a minimum computational time.

scholarly journals Optimal Placement and Sizing of an Energy Storage System Using a Power Sensitivity Analysis in a Practical Stand-Alone Microgrid

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1598
Author(s):  
Dongmin Kim ◽  
Kipo Yoon ◽  
Soo Hyoung Lee ◽  
Jung-Wook Park
Keyword(s):  
Sensitivity Analysis ◽  
Energy Storage ◽  
Power System ◽  
Renewable Energy Sources ◽  
Storage System ◽  
Energy Storage System ◽  
Optimization Techniques ◽  
Optimal Placement ◽  
Stable Operation ◽  
Analytical Approaches

The energy storage system (ESS) is developing into a very important element for the stable operation of power systems. An ESS is characterized by rapid control, free charging, and discharging. Because of these characteristics, it can efficiently respond to sudden events that affect the power system and can help to resolve congested lines caused by the excessive output of distributed generators (DGs) using renewable energy sources (RESs). In order to efficiently and economically install new ESSs in the power system, the following two factors must be considered: the optimal installation placements and the optimal sizes of ESSs. Many studies have explored the optimal installation placement and the sizing of ESSs by using analytical approaches, mathematical optimization techniques, and artificial intelligence. This paper presents an algorithm to determine the optimal installation placement and sizing of ESSs for a virtual multi-slack (VMS) operation based on a power sensitivity analysis in a stand-alone microgrid. Through the proposed algorithm, the optimal installation placement can be determined by a simple calculation based on a power sensitivity matrix, and the optimal sizing of the ESS for the determined placement can be obtained at the same time. The algorithm is verified through several case studies in a stand-alone microgrid based on practical power system data. The results of the proposed algorithm show that installing ESSs in the optimal placement could improve the voltage stability of the microgrid. The sizing of the newly installed ESS was also properly determined.

scholarly journals Solving the Real Power Limitations in the Dynamic Economic Dispatch of Large-Scale Thermal Power Units under the Effects of Valve-Point Loading and Ramp-Rate Limitations

2021 ◽  
Vol 13 (3) ◽  
pp. 1274
Author(s):  
Loau Al-Bahrani ◽  
Mehdi Seyedmahmoudian ◽  
Ben Horan ◽  
Alex Stojcevski
Keyword(s):  
Large Scale ◽  
Thermal Power ◽  
Optimization Technique ◽  
Economic Dispatch ◽  
Pso Algorithm ◽  
Search Space ◽  
Economic Benefits ◽  
Optimization Techniques ◽  
Ramp Rate ◽  
Dynamic Economic Dispatch

Few non-traditional optimization techniques are applied to the dynamic economic dispatch (DED) of large-scale thermal power units (TPUs), e.g., 1000 TPUs, that consider the effects of valve-point loading with ramp-rate limitations. This is a complicated multiple mode problem. In this investigation, a novel optimization technique, namely, a multi-gradient particle swarm optimization (MG-PSO) algorithm with two stages for exploring and exploiting the search space area, is employed as an optimization tool. The M particles (explorers) in the first stage are used to explore new neighborhoods, whereas the M particles (exploiters) in the second stage are used to exploit the best neighborhood. The M particles’ negative gradient variation in both stages causes the equilibrium between the global and local search space capabilities. This algorithm’s authentication is demonstrated on five medium-scale to very large-scale power systems. The MG-PSO algorithm effectively reduces the difficulty of handling the large-scale DED problem, and simulation results confirm this algorithm’s suitability for such a complicated multi-objective problem at varying fitness performance measures and consistency. This algorithm is also applied to estimate the required generation in 24 h to meet load demand changes. This investigation provides useful technical references for economic dispatch operators to update their power system programs in order to achieve economic benefits.

Sign in / Sign up

Export Citation Format

Share Document