Login

Login
Welcome:
Guest

Search for:


Browse:

Bannner: Aslib individual membership.
 
Journal search
Journal cover: COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

ISSN: 0332-1649

Online from: 1982

Subject Area: Electrical & Electronic Engineering

Content: Latest Issue | icon: RSS Latest Issue RSS | Previous Issues

Options: To add Favourites and Table of Contents Alerts please take a Emerald profile

Previous article.Icon: Print.Table of Contents.Next article.Icon: .

Design optimization of three-phase energy efficient induction motor using adaptive bacterial foraging algorithm


Document Information:
Title:Design optimization of three-phase energy efficient induction motor using adaptive bacterial foraging algorithm
Author(s):V.P. Sakthivel, (Department of Electrical Engineering, Faculty of Engineering and Technology, Annamalai University, Annamalai Nagar, India), R. Bhuvaneswari, (Institute for Energy Systems, Economics and Sustainability, Tallahassee, Florida, USA), S. Subramanian, (Department of Electrical Engineering, Faculty of Engineering and Technology, Annamalai University, Annamalai Nagar, India)
Citation:V.P. Sakthivel, R. Bhuvaneswari, S. Subramanian, (2010) "Design optimization of three-phase energy efficient induction motor using adaptive bacterial foraging algorithm", COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, Vol. 29 Iss: 3, pp.699 - 726
Keywords:Electric motors, Energy, Optimum design, Programming and algorithm theory
Article type:Research paper
DOI:10.1108/03321641011028260 (Permanent URL)
Publisher:Emerald Group Publishing Limited
Abstract:

Purpose – The purpose of this paper is to present the application of an adaptive bacterial foraging (BF) algorithm for the design optimization of an energy efficient induction motor.

Design/methodology/approach – The induction motor design problem is formulated as a mixed integer nonlinear optimization problem. A set of nine independent variables is selected, and to make the machine feasible and practically acceptable, six constraints are imposed on the design. Two different objective functions are considered, namely, the annual active material cost, and the sum of the annual active material cost, annual cost of the active power loss of the motor and annual energy cost required to supply such power loss. A new adaptive BF algorithm is used for solving the optimization problem. A generic penalty function method, which does not require any penalty coefficient, is employed for constraint handling.

Findings – The adaptive BF algorithm is validated for two sample motors and benchmarked with the genetic algorithm, particle swarm optimization, simple BF algorithm, and conventional design methods. The results show that the proposed algorithm outperforms the other methods in both the solution quality and convergence rate. The annual cost of the induction motor is remarkably reduced when designed on the basis of minimizing its annual total cost, instead of minimizing its material cost only.

Originality/value – To the best of the knowledge, none of the existing work has applied the BF algorithms for electrical machine design problems. Therefore, the solution to this problem constitutes the main contribution of the paper. According to the huge number of induction motors operating all over the world, the BF techniques used in their design, on minimum annual cost basis, will lead to a tremendous saving in global energy consumption.



Fulltext Options:

Login

Login

Existing customers: login
to access this document

Login


- Forgot password?

- Athens/Institutional login

Purchase

Purchase

Downloadable; Printable; Owned
HTML, PDF (552kb)Purchase

To purchase this item please login or register.

Login


- Forgot password?

Recommend to your librarian

Complete and print this form to request this document from your librarian


Marked list

Bookmark & share

Reprints & permissions

© Emerald Group Publishing Limited  |  Copyright information  |  Site policies  |  Cookie information
.