This paper presents the effect of different controllers on Load Frequency Control (LFC) of a two area interconnected thermal power system for the advancement of dynamic performance. Time domain simulations are perform...
详细信息
ISBN:
(纸本)9781467385879
This paper presents the effect of different controllers on Load Frequency Control (LFC) of a two area interconnected thermal power system for the advancement of dynamic performance. Time domain simulations are performed to investigate the performance of the system in the presence of generation rate constraint (GRC). The Controller consists of I, PI and PID compensator where the gain setting of proportional (P), integral (I) and derivative (D) constants are optimizes using gravitational search algorithm (GSA) and the objective function used for minimization is Integral of Time multiplied with Absolute value of Error (IT AE). Results reveal that for a step load disturbance, PID controller gives the better dynamic performance of LFC on I and PI compensator and keep the frequency and tie-line power within the range;hence, it proves the effectiveness of GSA based PID compensator in two area interconnected thermal system.
Thinning a large concentric ring array by an evolutionary algorithm needs to handle a large amount of variables. The computational time to find out the optimum elements set increases with the increase of array size. M...
详细信息
Thinning a large concentric ring array by an evolutionary algorithm needs to handle a large amount of variables. The computational time to find out the optimum elements set increases with the increase of array size. Moreover, thinning significantly reduces the directivity of the array. In this paper, the authors propose a pattern synthesis method to reduce the peak sidelobe level (peak SLL) while keeping first null beamwidth (FNBW) of the array fixed by thinning the outermost rings of the array based on gravitational search algorithm (GSA). Two different cases have been studied. In the first case only the outermost ring of the array is thinned and in the second case the two outermost rings are thinned. The FNBW of the optimized array is kept equal to or less than that of a fully populated, uniformly excited and 0.5 spaced concentric ring array of same number of elements and rings. The directivity of the optimized array for the above two cases are compared with an array optimized by thinning all the rings, while keeping the design criteria same as the above two cases. The optimized array by thinning the outermost rings gives higher directivity over the optimized array by thinning all the rings. Time required for computing the optimum elements state for the above two cases using GSA are shown lesser compared to the optimized array by thinning all the rings using the same algorithm. The peak SLL and the FNBW of the optimized array for the above two cases are also compared with the optimized array by thinning all the rings.
Multilevel image thresholding is a powerful and commonly used technique in image analysis. Conventional image segmentation methods suffer a large amount of computation time and unstable segmentation results. In this p...
详细信息
ISBN:
(纸本)9781467380751
Multilevel image thresholding is a powerful and commonly used technique in image analysis. Conventional image segmentation methods suffer a large amount of computation time and unstable segmentation results. In this paper, we present a multilevel image thresholding method based on fuzzy entropy and modified gravitational search algorithm. Fuzzy entropy based image thresholding is extended to multilevel, and a modified gravitational search algorithm (mGSA) is proposed to accelerate the multilevel fuzzy entropy maximization process. Experimental results show that the proposed method can obtain optimal multilevel thresholds and the proposed mGSA has more accurate and stable segmentation results compared with firefly algorithm (FA) and cuckoo search (CS).
For the past few years, many swarm intelligent optimization methods have been proposed. In this article, a new optimization algorithm based on gravitational search algorithm and chaos is introduced. In the new algorit...
详细信息
ISBN:
(纸本)9781509048403
For the past few years, many swarm intelligent optimization methods have been proposed. In this article, a new optimization algorithm based on gravitational search algorithm and chaos is introduced. In the new algorithm, chaotic operator is used by population initialization. Population would be regenerated when premature of algorithm. The new algorithm has been compared with some optimization methods. Numerical results confirm the high performance of the constructed method in solving global optimization problems.
The process of feature selection (FS) is a substantial task that has a significant effect in the performance of a given algorithm. The goal is to choose a subset of available features by eliminating the unnecessary fe...
详细信息
ISBN:
(纸本)9783662491553;9783662491546
The process of feature selection (FS) is a substantial task that has a significant effect in the performance of a given algorithm. The goal is to choose a subset of available features by eliminating the unnecessary features. This hybrid algorithm is in maximising the classification performance and minimising the number of features to achieve an outstanding performance through a less complex procedure. From the experiments, FSMOGSA was noted to be quite unparalleled in comparison with other methods in reducing the error rate, and maximising the general performance through irrelevant feature reduction.
gravitational search algorithm (GSA) is a meta-heuristic searchalgorithm based on the Newton's gravity law. In this article, a new variant of GSA is introduced, namely Accelerative gravitational search algorithm ...
详细信息
ISBN:
(纸本)9781509020287
gravitational search algorithm (GSA) is a meta-heuristic searchalgorithm based on the Newton's gravity law. In this article, a new variant of GSA is introduced, namely Accelerative gravitational search algorithm (AGSA). In the proposed AGSA, an acceleration coefficient is introduced in the velocity update equation to control the acceleration of the individual. In the proposed position update process individuals are allowed to explore the search space in early iterations while exploitation in later iterations. The reliability, robustness and accuracy of the proposed algorithm is measured through various statistical analyses over 12 complex test problems. To show the competitiveness of the proposed strategy, the reported results are compared with the results of GSA, Biogeography Based Optimization (BBO), and Differential Evaluation (DE) algorithms.
An improved methodology for parameter adaptation in GSA (gravitational search algorithm) is presented in where we use a fuzzy system to control the abilities of GSA to perform a global and local search. The results sh...
详细信息
ISBN:
(纸本)9781509013531
An improved methodology for parameter adaptation in GSA (gravitational search algorithm) is presented in where we use a fuzzy system to control the abilities of GSA to perform a global and local search. The results show that with our methodology GSA can outperform the quality of the results when compared with the original method and some other GSA improvements.
The gravitational search algorithm (GSA) is a nature inspired optimization algorithm which is based on Newton's law of gravity and law of motion. Biogeography Based Optimization (BBO) is also another nature inspir...
详细信息
ISBN:
(纸本)9781509032518
The gravitational search algorithm (GSA) is a nature inspired optimization algorithm which is based on Newton's law of gravity and law of motion. Biogeography Based Optimization (BBO) is also another nature inspired optimization algorithm based on the concept of biogeography (migration and mutation among population). Both of these optimization technique are population based and individually have been applied to a large number of areas. In this paper, we are providing a hybrid GSABBO algorithm that will use the best properties of both the algorithm to enhance the exploration and exploitation properties and reach at the global optimal solution. Grid Computing refers to the sharing of resources across multiple domains to achieve a common goal. Sharing of the resources within an organization helps to enhance its overall performance computationally and economically. The advantages derived from Grid Computing are largely dependent on the scheduling algorithm we use to schedule various jobs across various resources available. This paper introduces a new approach based on the hybridization of BBO and GSA to generate optimal schedules to complete all the given tasks with minimum make span period.
This paper aims to design IIR digital differentiator by adopting a new heuristic algorithm called a gravitational search algorithm (GSA). In GSA, agents are treated as the masses and the force of attraction between ag...
详细信息
ISBN:
(纸本)9781467365406
This paper aims to design IIR digital differentiator by adopting a new heuristic algorithm called a gravitational search algorithm (GSA). In GSA, agents are treated as the masses and the force of attraction between agents is calculated based on Newton's gravitation law to find optimal solutions to the problem. The agent with greater mass is treated as the near optimal solution and their position is a reflection of the solution. Simulations to find optimal filter coefficients of second, third and fourth order differentiators using GSA have been performed. Total absolute magnitude error and maximum phase error are the performance measures that are used to evaluate performance of the proposed differentiators. The result of the proposed GSA based approach has been compared with the standard existing algorithms like PSO, GA, SA, pole zero (PZ) and segment rule. Simulations show that GSA gives superior results when compared with the optimization abilities of other standard algorithms.
This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm (IGSA) in a dynamic environment. GSA is improved based on memory information, soc...
详细信息
This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm (IGSA) in a dynamic environment. GSA is improved based on memory information, social, cognitive factor of PSO (particle swarm optimization) and then, population for next generation is decided by the greedy strategy. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position. Finally, the analytical and experimental results of the multi-robot path planning have been compared with those obtained by IGSA, GSA and PSO in a similar environment. The simulation and the Khepera environmental results outperform IGSA as compared to GSA and PSO with respect to performance matrix.
暂无评论