Asansol Engineering College

About: Asansol Engineering College is a based out in . It is known for research contribution in the topics: Electric power system & AC power. The organization has 186 authors who have published 407 publications receiving 3714 citations. The organization is also known as: AEC.

Intelligent particle swarm optimized fuzzy pid controller for avr system

Abstract: In process plants like thermal power plants, biomedical instrumentation the popular use of proportional-integral-derivative (PID) controllers can be noted. Proper tuning of such controllers is obviously a prime priority as any other alternative situation will require a high degree of industrial expertise. So in order to get the best results of PID controllers the optimal tuning of PID gains is required. This paper, thus, deals with the determination of off-line, nominal, optimal PID gains of a PID controller of an automatic voltage regulator (AVR) for nominal system parameters and step reference voltage input. Craziness based particle swarm optimization (CRPSO) and binary coded genetic algorithm (GA) are the two props used to get the optimal PID gains. CRPSO proves to be more robust than GA in performing optimal transient performance even under various nominal operating conditions. Computational time required by CRPSO is lesser than that of GA. Factors that have influenced the enhancement of global searching ability of PSO are the incorporation of systematic and intelligent velocity, position updating procedure and introduction of craziness. This modified from of PSO is termed as CRPSO. For on-line off-nominal system parameters Sugeno fuzzy logic (SFL) is applied to get on-line terminal voltage response. The work of SFL is to extrapolate intelligently and linearly, the nominal optimal gains in order to determine off-nominal optimal gains. The on-line computational burden of SFL is noticeably low. Consequently, on-line optimized transient response of incremental change in terminal voltage is obtained.

A novel opposition-based gravitational search algorithm for combined economic and emission dispatch problems of power systems

Abstract: Gravitational search algorithm (GSA) is based on the law of gravity and interaction between masses. In GSA, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. This paper proposes a novel algorithm to accelerate the performance of the GSA. The proposed opposition-based GSA (OGSA) of the present work employs opposition-based learning for population initialization and also for generation jumping. In the present work, opposite numbers have been utilized to improve the convergence rate of the GSA. For the experimental verification of the proposed algorithm, a comprehensive set of 23 complex benchmark test functions including a wide range of dimensions is employed. Additionally, four standard power systems problems of combined economic and emission dispatch (CEED) are solved by the OGSA to establish the optimizing efficacy of the proposed algorithm. The results obtained confirm the potential and effectiveness of the proposed algorithm compared to some other algorithms surfaced in the recent state-of-the art literatures. Both the near-optimality of the solution and the convergence speed of the proposed algorithm are promising.

Solution of reactive power dispatch of power systems by an opposition-based gravitational search algorithm

Abstract: Gravitational search algorithm (GSA) is based on law of gravity and the interaction between masses. In GSA, searcher agents are collection of masses and their interactions are based on Newtonian laws of gravity and motion. In this paper, to further improve the optimization performance of GSA, opposition-based learning is employed in opposition-based gravitational search algorithm (OGSA) for population initialization and also for generation jumping. In the present work, OGSA is applied for the solution of optimal reactive power dispatch (ORPD) of power systems. Traditionally, ORPD is defined as the minimization of active power transmission losses by controlling a number of control variables. ORPD is formulated as a non-linear constrained optimization problem with continuous and discrete variables. In this work, OGSA is used to find the settings of control variables such as generator voltages, tap positions of tap changing transformers and amount of reactive compensation to optimize certain objectives. The study is implemented on IEEE 30-, 57- and 118-bus test power systems with different objectives that reflect minimization of either active power loss or that of total voltage deviation or improvement of voltage stability index. The obtained results are compared to those yielded by the other evolutionary optimization techniques surfaced in the recent state-of-the-art literature including basic GSA. The results presented in this paper demonstrate the potential of the proposed approach and show its effectiveness and robustness for solving ORPD problems of power systems.

Solution of combined economic and emission dispatch problems of power systems by an opposition-based harmony search algorithm

Abstract: Evolutionary algorithms (EAs) are well-known optimization approaches to deal with nonlinear and complex problems. However, these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. Harmony search (HS) is a derivative-free real parameter optimization algorithm. It draws inspiration from the musical improvisation process of searching for a perfect state of harmony. This paper proposes a novel approach to accelerate the HS algorithm. The proposed opposition-based HS of the present work employs opposition-based learning for harmony memory initialization and also for the generation jumping. In the present work, opposite numbers have been utilized to improve the convergence rate of the HS. The potential of the proposed algorithm, presented in this paper, is assessed by means of an extensive comparative study of the solution obtained for four standard combined economic and emission dispatch problems of power systems. The results obtained confirm the potential and effectiveness of the proposed algorithm compared to some other algorithms surfaced in the recent state-of-the art literatures. Both the near-optimality of the solution and the convergence speed of the proposed algorithm are found to be promising.

Secure Biometric-Based Authentication Scheme Using Chebyshev Chaotic Map for Multi-Server Environment

Abstract: Multi-server environment is the most common scenario for a large number of enterprise class applications. In this environment, user registration at each server is not recommended. Using multi-server authentication architecture, user can manage authentication to various servers using single identity and password. We introduce a new authentication scheme for multi-server environments using Chebyshev chaotic map. In our scheme, we use the Chebyshev chaotic map and biometric verification along with password verification for authorization and access to various application servers. The proposed scheme is light-weight compared to other related schemes. We only use the Chebyshev chaotic map, cryptographic hash function and symmetric key encryption-decryption in the proposed scheme. Our scheme provides strong authentication, and also supports biometrics & password change phase by a legitimate user at any time locally, and dynamic server addition phase. We perform the formal security verification using the broadly-accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) tool to show that the presented scheme is secure. In addition, we use the formal security analysis using the Burrows-Abadi-Needham (BAN) logic along with random oracle models and prove that our scheme is secure against different known attacks. High security and significantly low computation and communication costs make our scheme is very suitable for multi-server environments as compared to other existing related schemes.