Author

# T. Jayabarathi

Other affiliations: Anna University

Bio: T. Jayabarathi is an academic researcher from VIT University. The author has contributed to research in topics: Economic dispatch & Particle swarm optimization. The author has an hindex of 22, co-authored 65 publications receiving 2026 citations. Previous affiliations of T. Jayabarathi include Anna University.

##### Papers published on a yearly basis

##### Papers

More filters

••

TL;DR: Comparisons show that the hybrid grey wolf optimizer used in this paper either matches or outperforms the other methods.

278 citations

••

TL;DR: A new metaheuristic optimization algorithm, the chaotic bat algorithm, is presented for solving the economic dispatch problem involving a number of equality and inequality constraints such as power balance, prohibited operating zones and ramp rate limits.

271 citations

••

VIT University

^{1}TL;DR: In this article, a successful adaptation of the particle swarm optimisation (PSO) algorithm to solve various types of economic dispatch (ED) problems in power systems such as, multi-area ED with tie line limits, ED with multiple fuel options, combined environmental economic dispatch, and the ED of generators with prohibited operating zones.

227 citations

••

VIT University

^{1}TL;DR: Test results of a 33 bus sample network have shown that the proposed feeder reconfiguration method can effectively ensure the loss minimization, and the BFOA technique is efficient in searching for the optimal solution.

190 citations

••

TL;DR: This paper proposes a solution to this non-convex, discrete problem by using the hybrid grey wolf optimizer, a new metaheuristic algorithm, applied to IEEE 33-, IEEE 69-, and Indian 85-bus radial distribution systems to minimize the power loss.

Abstract: Optimal allocation of distributed generation units is essential to ensure power loss minimization, while meeting the real and reactive power demands in a distribution network. This paper proposes a solution to this non-convex, discrete problem by using the hybrid grey wolf optimizer, a new metaheuristic algorithm. This algorithm is applied to IEEE 33-, IEEE 69-, and Indian 85-bus radial distribution systems to minimize the power loss. The results show that there is a considerable reduction in the power loss and an enhancement of the voltage profile of the buses across the network. Comparisons show that the proposed method outperforms all other metaheuristic methods, and matches the best results by other methods, including exhaustive search, suggesting that the solution obtained is a global optimum. Furthermore, unlike for most other metaheuristic methods, this is achieved with no tuning of the algorithm on the part of the user, except for the specification of the population size.

169 citations

##### Cited by

More filters

••

TL;DR: This work presents a comprehensive survey of the advances with ABC and its applications and it is hoped that this survey would be very beneficial for the researchers studying on SI, particularly ABC algorithm.

Abstract: Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and self-organized swarms. The well known examples for these swarms are bird flocks, fish schools and the colony of social insects such as termites, ants and bees. In 1990s, especially two approaches based on ant colony and on fish schooling/bird flocking introduced have highly attracted the interest of researchers. Although the self-organization features are required by SI are strongly and clearly seen in honey bee colonies, unfortunately the researchers have recently started to be interested in the behaviour of these swarm systems to describe new intelligent approaches, especially from the beginning of 2000s. During a decade, several algorithms have been developed depending on different intelligent behaviours of honey bee swarms. Among those, artificial bee colony (ABC) is the one which has been most widely studied on and applied to solve the real world problems, so far. Day by day the number of researchers being interested in ABC algorithm increases rapidly. This work presents a comprehensive survey of the advances with ABC and its applications. It is hoped that this survey would be very beneficial for the researchers studying on SI, particularly ABC algorithm.

1,645 citations

••

Wenzhou University

^{1}, Duy Tan University^{2}, National University of Singapore^{3}, University of Tehran^{4}TL;DR: The proposed slime mould algorithm has several new features with a unique mathematical model that uses adaptive weights to simulate the process of producing positive and negative feedback of the propagation wave of slime mould based on bio-oscillator to form the optimal path for connecting food with excellent exploratory ability and exploitation propensity.

1,443 citations

••

TL;DR: A split-up in the cognitive behavior of the classical particle swarm optimization (PSO) is proposed, that is, the particle is made to remember its worst position also, which helps to explore the search space very effectively.

Abstract: This paper proposes a new version of the classical particle swarm optimization (PSO), namely, new PSO (NPSO), to solve nonconvex economic dispatch problems. In the classical PSO, the movement of a particle is governed by three behaviors, namely, inertial, cognitive, and social. The cognitive behavior helps the particle to remember its previously visited best position. This paper proposes a split-up in the cognitive behavior. That is, the particle is made to remember its worst position also. This modification helps to explore the search space very effectively. In order to well exploit the promising solution region, a simple local random search (LRS) procedure is integrated with NPSO. The resultant NPSO-LRS algorithm is very effective in solving the nonconvex economic dispatch problems. To validate the proposed NPSO-LRS method, it is applied to three test systems having nonconvex solution spaces, and better results are obtained when compared with previous approaches

814 citations

••

TL;DR: In this article, an improved genetic algorithm with multiplier updating (IGA/spl I.bar/MU) was proposed to solve power economic dispatch (PED) problems of units with valve-point effects and multiple fuels.

Abstract: This paper presents an improved genetic algorithm with multiplier updating (IGA/spl I.bar/MU) to solve power economic dispatch (PED) problems of units with valve-point effects and multiple fuels. The proposed IGA/spl I.bar/MU integrates the improved genetic algorithm (IGA) and the multiplier updating (MU). The IGA equipped with an improved evolutionary direction operator and a migration operation can efficiently search and actively explore solutions, and the MU is employed to handle the equality and inequality constraints of the PED problem. Few PED problem-related studies have seldom addressed both valve-point loadings and change fuels. To show the advantages of the proposed algorithm, which was applied to test PED problems with one example considering valve-point effects, one example considering multiple fuels, and one example addressing both valve-point effects and multiple fuels. Additionally, the proposed algorithm was compared with previous methods and the conventional genetic algorithm (CGA) with the MU (CGA/spl I.bar/MU), revealing that the proposed IGA/spl I.bar/MU is more effective than previous approaches, and applies the realistic PED problem more efficiently than does the CGA/spl I.bar/MU. Especially, the proposed algorithm is highly promising for the large-scale system of the actual PED operation.

601 citations

••

TL;DR: The proposed combined method outperforms other state-of-the-art algorithms in solving load dispatch problems with the valve-point effect.

Abstract: Evolutionary algorithms are heuristic methods that have yielded promising results for solving nonlinear, nondifferentiable, and multi-modal optimization problems in the power systems area. The differential evolution (DE) algorithm is an evolutionary algorithm that uses a rather greedy and less stochastic approach to problem solving than do classical evolutionary algorithms, such as genetic algorithms, evolutionary programming, and evolution strategies. DE also incorporates an efficient way of self-adapting mutation using small populations. The potentialities of DE are its simple structure, easy use, convergence property, quality of solution, and robustness. This paper proposes a new approach for solving economic load dispatch problems with valve-point effect. The proposed method combines the DE algorithm with the generator of chaos sequences and sequential quadratic programming (SQP) technique to optimize the performance of economic dispatch problems. The DE with chaos sequences is the global optimizer, and the SQP is used to fine-tune the DE run in a sequential manner. The combined methodology and its variants are validated for two test systems consisting of 13 and 40 thermal units whose incremental fuel cost function takes into account the valve-point loading effects. The proposed combined method outperforms other state-of-the-art algorithms in solving load dispatch problems with the valve-point effect.

587 citations