scholarly journals Non-Convex Economic Dispatch with Prohibited Operating Zones through Gravitational Search Algorithm

Author(s):  
Prakash Kumar Hota ◽  
Nakul Charan Sahu

This paper presents a new approach to the solution of optimal power generation for economic load dispatch (ELD) using gravitational search algorithm (GSA) when all the generators include valve point effects and some/all of the generators have prohibited operating zones. In this paper a gravitational search algorithm is suggested that deals with equality and inequality constraints in ELD problems. A constraint treatment mechanism is also discussed to accelerate the optimization process<strong>. </strong>To verify the robustness and superiority of the proposed GSA based approach, a practical sized 40-generators case with valve point effects and prohibited operating zones is considered. The simulation results reveal that the proposed GSA approach ensures convergence within an acceptable execution time and provides highly optimal solution as compared to the results obtained from well established heuristic optimization approaches.

2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  

2016 ◽  
Vol 6 (3) ◽  
pp. 290-313 ◽  
Author(s):  
Ahmed F. Ali ◽  
Mohamed A. Tawhid

AbstractA gravitational search algorithm (GSA) is a meta-heuristic development that is modelled on the Newtonian law of gravity and mass interaction. Here we propose a new hybrid algorithm called the Direct Gravitational Search Algorithm (DGSA), which combines a GSA that can perform a wide exploration and deep exploitation with the Nelder-Mead method, as a promising direct method capable of an intensification search. The main drawback of a meta-heuristic algorithm is slow convergence, but in our DGSA the standard GSA is run for a number of iterations before the best solution obtained is passed to the Nelder-Mead method to refine it and avoid running iterations that provide negligible further improvement. We test the DGSA on 7 benchmark integer functions and 10 benchmark minimax functions to compare the performance against 9 other algorithms, and the numerical results show the optimal or near optimal solution is obtained faster.


2020 ◽  
Vol 897 ◽  
pp. 147-151
Author(s):  
Naji Mutar Sahib ◽  
Abtehaj Hussein ◽  
Suha Falih ◽  
Hafeth I. Naji

Construction projects are a combination of high complicated procedures that rarely go with the plan. The greatest dangers projects are the construction since it linked with an extraordinary amount of ambiguity and threat and that because of the business activities nature, procedures, and the outside surroundings. This paper investigates the problems during the pre-construction phase and the optimal solution for this problem by using to algorithm, partial swarm and Gravitational search algorithm. The results show that the construction problems have a severe effect on both time and cost and these problems must be treated immediately and this requires sophisticated techniques by using computer science. GSA and PSO are both used and show excellent results in solving these problems, the GSA algorithm shows better results in both the velocity is taken to find the solutions and in the accuracy. PSO is still a good technique in finding the solution and their future recommendation in making an expert system to find the solution more than one project and their interdependency.


Sign in / Sign up

Export Citation Format

Share Document