The performance of COR optimisation using different constraint handling strategies to solve ELD

This research compares the performance of Competitive Over Resources (COR) optimisation method using a different type of constraint handling strategy to solve the economic load dispatch (ELD) problem. Previously, most research focused on proposing various optimisation techniques using the Penalty Factor Strategy (PFS) to search for a better global optimum. The issue using the penalty factor is that it is difficult to find the correct tune of constant value that influences the algorithm to find the solution. The other technique is using Feasible Solution Strategy (FSS), the idea of which is to locate the infeasible particle to the feasible solution and avoid being trapped by the unsuccessful condition of constraint. This paper investigates the performance of PFS and FSS on the COR optimisation method for solving ELD. Both strategies have been tested on two standard test systems to compare the performance in terms of a global solution, robustness and convergence. The simulation shows that FSS is a better solution compared to PFS.

Download Full-text

An Efficient Constraint Handling Approach for Economic Load Dispatch Problem with Non-Smooth Cost Function

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.785.490 ◽

2015 ◽

Vol 785 ◽

pp. 490-494 ◽

Cited By ~ 1

Author(s):

Mohd Noor Abdullah ◽

A.H.A. Bakar ◽

Hazlie Mokhlis ◽

Jasrul Jamani Jamian

Keyword(s):

Penalty Function ◽

Feasible Solution ◽

Constraint Handling ◽

Economic Load Dispatch ◽

Ramp Rate ◽

Penalty Factor ◽

Constraints Handling ◽

Rate Limit ◽

Penalty Function Approach ◽

Better Than

Increasing of the power demand and fuel cost in power generation required an advanced algorithm for scheduling the output of generating unit in economical manner. The economic load dispatch problem (ELD) problem consists several operational and system constraints such as prohibited operating zones (POZs) and ramp-rate limit that need to handle wisely by optimization algorithm. Previously, the penalty function is widely used to satisfy the power balance and other constraints by augmenting the objective function with the penalized function. However, it required a proper penalty factor tuning and depends on the size of problem. This paper proposes an efficient constraint handling based on the repairing or adjusting infeasible solution into feasible solution in every iterative process. The simulation results show that the proposed constraints handling approach is better than penalty function approach in term of convergence characteristic and robustness.

Download Full-text

A New Algorithm and Computation Approach for Economic Dispatch with Prohibited Operating Zones in Power Systems

Energy Exploration & Exploitation ◽

10.1260/014459805775219148 ◽

2005 ◽

Vol 23 (4) ◽

pp. 267-275

Author(s):

Nurettin Çetinkaya ◽

Abdullah Ürkmez ◽

İsmet Erkmen ◽

Tankut Yalçinöz

Keyword(s):

Power Systems ◽

Electrical Power ◽

Quadratic Function ◽

Power Production ◽

Standard Test ◽

The Other ◽

Economic Load Dispatch ◽

Electrical Power Systems ◽

Prohibited Operating Zones ◽

Cost Curves

This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the ELD problem. If production units cost curves are represented properly then ELD becomes more correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the production units in the prohibited operating zones. The proposed method and algorithm are compared to other ELD methods on the standard test systems. The proposed method solve the dispatch problem faster than the other ELD methods.

Download Full-text

Special Issue on Reconfiguration Problems

Algorithms ◽

10.3390/a11110187 ◽

2018 ◽

Vol 11 (11) ◽

pp. 187

Author(s):

Faisal Abu-Khzam ◽

Henning Fernau ◽

Ryuhei Uehara

Keyword(s):

Feasible Solution ◽

Solution Space ◽

The Other ◽

Special Issue ◽

Typical Application ◽

Repair Work ◽

One Step

The study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions. The solution space is often represented by a “reconfiguration graph”, where vertices represent solutions to the problem in hand and an edge between two vertices means that one can be obtained from the other in one step. A typical application background would be for a reorganization or repair work that has to be done without interruption to the service that is provided.

Download Full-text

Introducing modified version of penguins search optimization algorithm (PeSOA) and its application in optimal operation of reservoir systems

Water Science & Technology Water Supply ◽

10.2166/ws.2017.217 ◽

2017 ◽

Vol 18 (4) ◽

pp. 1484-1496 ◽

Cited By ~ 5

Author(s):

Afshin Mansouri ◽

Babak Aminnejad ◽

Hassan Ahmadi

Keyword(s):

Genetic Algorithm ◽

Optimization Algorithm ◽

Real World ◽

Global Optimum ◽

Optimal Operation ◽

The Other ◽

Reservoir System ◽

Search Optimization ◽

Real World Problem ◽

Reservoir Systems

Abstract In the current study, modified version of the penguins search optimization algorithm (PeSOA) was introduced, and its usage was assessed in the water resources field. In the modified version (MPeSOA), the Gaussian exploration was added to the algorithm. The MPeSOA performance was evaluated in optimal operation of a hypothetical four-reservoir system and Karun-4 reservoir as a real world problem. Also, genetic algorithm (GA) was used as a criterion for evaluating the performance of PeSOA and MPeSOA. The results revealed that in a four-reservoir system problem, the PeSOA performance was much weaker than the GA; but on the other hand, the MPeSOA had better performance than the GA. In the mentioned problem, PeSOA, GA, and MPeSOA reached 78.43, 97.46, and 98.30% of the global optimum, respectively. In the operation of Karun-4 reservoir, although PeSOA performance had less difference with the two other algorithms than four-reservoir problem, its performance was not acceptable. The average values of objective function in this case were equal to 26.49, 23.84, and 21.48 for PeSOA, GA, and MPeSOA, respectively. According to the results obtained in the operation of Karun-4 reservoir, the algorithms including MPeSOA, GA, and PeSOA were situated in ranks one to three in terms of efficiency, respectively.

Download Full-text

A Competitive Memory Paradigm for Multimodal Optimization Driven by Clustering and Chaos

Mathematics ◽

10.3390/math8060934 ◽

2020 ◽

Vol 8 (6) ◽

pp. 934

Author(s):

Jorge Gálvez ◽

Erik Cuevas ◽

Krishna Gopal Dhal

Keyword(s):

Optimization Problems ◽

Optimization Methods ◽

Global Optimum ◽

Point Of View ◽

The Other ◽

Memory Mechanism ◽

Dominant Individual ◽

Complex Optimization ◽

Optimal Values ◽

Evolutionary Operators

Evolutionary Computation Methods (ECMs) are proposed as stochastic search methods to solve complex optimization problems where classical optimization methods are not suitable. Most of the proposed ECMs aim to find the global optimum for a given function. However, from a practical point of view, in engineering, finding the global optimum may not always be useful, since it may represent solutions that are not physically, mechanically or even structurally realizable. Commonly, the evolutionary operators of ECMs are not designed to efficiently register multiple optima by executing them a single run. Under such circumstances, there is a need to incorporate certain mechanisms to allow ECMs to maintain and register multiple optima at each generation executed in a single run. On the other hand, the concept of dominance found in animal behavior indicates the level of social interaction among two animals in terms of aggressiveness. Such aggressiveness keeps two or more individuals as distant as possible from one another, where the most dominant individual prevails as the other withdraws. In this paper, the concept of dominance is computationally abstracted in terms of a data structure called “competitive memory” to incorporate multimodal capabilities into the evolutionary operators of the recently proposed Cluster-Chaotic-Optimization (CCO). Under CCO, the competitive memory is implemented as a memory mechanism to efficiently register and maintain all possible optimal values within a single execution of the algorithm. The performance of the proposed method is numerically compared against several multimodal schemes over a set of benchmark functions. The experimental study suggests that the proposed approach outperforms its competitors in terms of robustness, quality, and precision.

Download Full-text

Solution Region Synthesis Methodology of Spatial 5-SS Linkages for Six Given Positions

Journal of Mechanisms and Robotics ◽

10.1115/1.4036219 ◽

2017 ◽

Vol 9 (4) ◽

Cited By ~ 4

Author(s):

Jianyou Han ◽

Guangzhen Cui

Keyword(s):

Feasible Solution ◽

Limited Range ◽

The Other ◽

Dimensional Synthesis ◽

Link Length ◽

End Effector ◽

Solution Region ◽

Fixed Solution ◽

Synthesis Methodology

This paper presents a solution region synthesis methodology to perform the dimensional synthesis of spatial 5-spherical–spherical (SS) linkages for six specified positions of the end-effector. Dimensional synthesis equations for an SS link are formulated. After solving the synthesis equations, the curves of moving and fixed joints can be obtained, and they are called moving and fixed solution curves, respectively. Each point on the curves represents an SS link. Considering the limited range of joints at the first position, we can obtain the feasible solution curves. The link length curves can be obtained based on the feasible solution curves. We determine three SS links by selecting three points meeting the requirements on link length curves. Then, the solution region is built by sorting and adding feasible solution curves and projecting the feasible solution curves on the line. The feasible solution region can be obtained by eliminating defective linkages and linkages that fail to meet the other requirements from the solution region. The validity of the formulas and applicability of the proposed approach is illustrated by example.

Download Full-text

OPTIMAL DESIGN OF STRUCTURES USING THE SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION ALGORITHM

International Journal of Computational Methods ◽

10.1142/s0219876209001826 ◽

2009 ◽

Vol 06 (02) ◽

pp. 229-245 ◽

Cited By ~ 2

Author(s):

S. FALLAHIAN ◽

D. HAMIDIAN ◽

S. M. SEYEDPOOR

Keyword(s):

Optimal Design ◽

Stochastic Approximation ◽

Optimization Problem ◽

Computational Cost ◽

Global Optimum ◽

The Other ◽

Optimization Process ◽

Simultaneous Perturbation Stochastic Approximation ◽

Stochastic Nature ◽

Problem Dimension

This paper presents an application of the simultaneous perturbation stochastic approximation (SPSA) algorithm to optimization of structures. This method requires only two structural analyses in each cycle of optimization process, regardless of optimization problem dimension. This characteristic is very promising in reduction of computational cost of optimization process, especially in problems with a large number of variables to be optimized. Furthermore, the stochastic nature of the SPSA can enhance the convergence of the method to achieve the global optimum. In order to assess the effectiveness of the proposed method some benchmark truss examples are considered. The numerical results demonstrate the competence of the method in comparison with the other methods found in the literature.

Download Full-text

Robust Multi-Area Economic Dispatch Using Coulomb’s and Franklin’s Laws Based Optimizer

International Journal of Engineering and Technology Innovation ◽

10.46604/ijeti.2020.5447 ◽

2020 ◽

Vol 10 (4) ◽

pp. 235-251

Author(s):

Vadugapalayam Ponnuvel Sakthivel ◽

Murugesan Suman ◽

Palanigounder Duraisamy Sathya

Keyword(s):

State Of The Art ◽

Cost Effective ◽

New Physics ◽

Standard Test ◽

Economic Load Dispatch ◽

Exchange Market ◽

Suggested Approach ◽

Generation Planning ◽

Excess Power

The multi-area economic load dispatch (MAELD) can reduce running costs through making the areas with more cost-effective units produce more energy. The excess power is transferred to the areas with expensive units. This paper contributes a new physics inspired metaheuristic approach called the Coulomb’s and Franklin’s laws based optimizer (CFLBO) to solve the MAELD problem. The CFLBO approach is developed from Coulomb’s and Franklin’s theories, which comprise attraction/repulsion, probabilistic ionization, and contact stages. The effectiveness of the envisaged CFLBO approach has been examined on three standard test systems with various areas. Results obtained by the CFLBO approach are compared with the exchange market algorithm (EMA) and the existing state-of-the-art approaches to deal with MAELD. Numerical outcomes show the benefits of the quick convergence and better quality of the suggested approach compared to existing strategies. Consequently, the proposed approach is a helpful tool for generation planning in MAELD problems.

Download Full-text

Simultaneous Rp-Hplc Method For Determination Of Betamethasone Dipropionate And Tolnaftate In Combined Semisolid Formulation

Journal of University of Shanghai for Science and Technology ◽

10.51201/jusst/22/0129 ◽

2022 ◽

Vol 24 (1) ◽

pp. 201-215

Author(s):

Radhika. V ◽

◽

T. Ramesh ◽

Keyword(s):

Analytical Solution ◽

Hplc Method ◽

The Other ◽

Betamethasone Dipropionate ◽

Rp Hplc ◽

System Suitability ◽

Validation Parameters ◽

Solution Robustness ◽

Precision System

A new RP-HPLC method was developed for selective and simultaneous determination of betamethasone dipropionate and tolnaftate in combined semisolid formulation containing other components. Further, the proposed method was validated for linearity, precision (system precision, method precision, intermediate or inter-day precision), accuracy, stability in analytical solution, robustness or system suitability and ruggedness. The developed method exhibited the best results in terms of the aforesaid validation parameters. The other components and additives did not interfere in their determinations. The method was found to be selective, simple, economical, accurate, reproducible, rapid and reliable for routine estimation purpose of these drugs in combined semisolid formulations.

Download Full-text