scholarly journals Flower Pollination Algorithm to Solve Dynamic Economic Loading of Units with Practical Constraints

Dynamic h“economic load dispatch (DELD) aims to obtain optimum generation schedule of the committed generating units’ output over ha certain timing horizon”, sustaining practical restrictions and power demands in each period.”Valve-point effect, the ramp up/down limits, prohibited operation zones (POZs), and power losses form the hDELD has ha complex, non-linear liable’ problem. The Flower Pollination Algorithm (FPA) his therefore anticipated in this paper to solve such a complex issue. The practicality of the proposed FPA method is assessed by conducting simulations at different load patterns hon standard 5-unit and 10-unit systems for ha 24-hour schedule. The FPA's simulation results hare related to other previously published biography techniques. These results clearly show that the skill hand robustness hof the proposed FPA method to solve the non h- linear DELD problem has been restricted.

Author(s):  
Y Venkata Krihshna Reddy ◽  
M Damodar Reddy

This paper presents a Flower Pollination Algorithm (FPA) to solve Dynamic Economic Load Dispatch (DELD) problem with valve-point effects and piecewise fuel options. DELD aims to find out optimum generation schedule of the committed generating units over a certain timing period, sustaining practical constraints and power demands in each interval. Due to the valve-point effect and piecewise fuel options DELD becomes as complex problem, hence in order to achieve the cost reduction and satisfying the dynamic behaviour of the generating units proposed algorithm presented.  The practicality of the proposed method is evaluated by performing simulations on standard 10-unit and 19-unit Indian utility systems for a 24 h time schedule at various load patterns. The simulation results attained by the FPA are related with other previous published techniques of the biography. These results clearly show that the proficiency and robustness of the proposed FPA method for resolving the non-linear constrained DELD problem.


2021 ◽  
Vol 9 (1) ◽  
pp. 127-133
Author(s):  
V. V. D. Sahithi, M. Srinivasa Rao, C. S. P. Rao

In this competitive and constantly changing world, meeting the customer requirements within less time by providing less cost is extremely tricky task. This is only possible by optimizing all the different parameters in its life cycle. Here Optimizing the inventory plays a major role.Maintaining the exact amount of inventory, at proper place, in appropriate level is a challenging task for production managers. When we work on Multi level environments this problem becomes even more complex.So, to optimize this kind of problems we applied binary form of Flower Pollination algorithm to solve this complex problem. we solved different inventory lot sizing problems with this FP algorithm and compared the results with genetic algorithm and other algorithms. In all the scenarios our simulation results shown that FP algorithm is better than other algorithms.                       


Author(s):  
Rafael Ochsendorf G. Souza ◽  
Ezequiel Silva Oliveira ◽  
Ivo Chaves Silva Junior ◽  
André Luís Marques Marcato ◽  
Marcos T. B. de Oliveira

2021 ◽  
Vol 9 (2) ◽  
pp. 274-280
Author(s):  
V.V.D.Sahithi, Et. al.

In this competitive and constantly changing world, meeting the customer requirements within less time by providing less cost is extremely tricky task. This is only possible by optimizing all the different parameters in its life cycle. Here Optimizing the inventory plays a major role.Maintaining the exact amount of inventory, at proper place, in appropriate level is a challenging task for production managers. When we work on Multi level environments this problem becomes even more complex.So, to optimize this kind of problems we applied binary form of Flower Pollination algorithm to solve this complex problem. we solved different inventory lot sizing problems with this FP algorithm and compared the results with genetic algorithm and other algorithms. In all the scenarios our simulation results shown that FP algorithm is better than other algorithms


2021 ◽  
pp. 77-86
Author(s):  
Hung-Peng Lee ◽  
Trong-The Nguyen ◽  
Thi-Kien Dao ◽  
Van-Dinh Vu ◽  
Truong-Giang Ngo

2021 ◽  
Vol 873 (1) ◽  
pp. 012018
Author(s):  
F Raflesia ◽  
W Widodo

Abstract Inversion of schlumberger sounding curve is non-linear, and multi-minimum. All linear inversion strategies can produce local optimum, and depend on the initial model. Meanwhile, the non-linear bionic method for inversion problems does not require an initial model, simple, flexible, derivation-free mechanism and can avoid local optimum. One of the new algorithm of the non-linear bionic method for geophysical inversion problem is the Flower Pollination Algorithm (FPA). The FPA is used for the inversion of schlumberger sounding curve. This algorithm was stimulated by the pollination process for blooming plants. The applicability of the present algorithm was tested on synthetic models A-type and KH-type curve. Numerical tests in MATLAB R2013a for the synthetic data and the observed data show that FPA can find the global minimum. For further study, inverted results using the FPA are contrasted with the damped least-square (DLSQR) inversion program, Particle Swarm Optimization (PSO), and Grey Wolf Optimizer (GWO). The outcomes of the comparison reveal that FPA performs better than the DLSQR inversion program, PSO, and GWO.


Author(s):  
Muhammad Iqbal Kamboh ◽  
Nazri Mohd Nawi ◽  
Radiah Bt. Mohamad

<span>The economic dispatch is used to find the best optimal output of power generation at the lowest operating cost of each generator, to fulfill the requirements of the consumer. To get a practical solution, several constraints have to be considered, like transmission losses, the valve point effect, prohibited operating region, and emissions. In this research, the valve point effect is to be considered which increases the complexity of the problem due to its ripple effect on the fuel cost curve. Economic load dispatch problems are well-known optimization problems. Many classical and meta-heuristic techniques have been used to get better solutions.  However, there is still room for improvement to get an optimal solution for the economic dispatch problem. In this paper, an Improved Flower Pollination Algorithm with dynamic switch probability and crossover operator is proposed to solve these complex optimization problems.  The performance of our proposed technique is analyzed against fast evolutionary programming (FEP), modified fast evolutionary programming (MFEP), improved fast evolutionary programming (IFEP), artificial bee colony algorithm (ABC), modified particle swarm optimization (MPSO) and standard flower pollination algorithm (SFPA) using three generator units and thirteen thermal power generation units, by including the effects of valve point loading unit and without adding it. The proposed technique has outperformed other methods in terms of the lowest operating fuel cost.</span>


Sign in / Sign up

Export Citation Format

Share Document