Search

This article deals with the design optimization of a squirrel-cage three-phase induction motor, selected as the driving power of spinning machines in the textile industry, using three newly developed versions of differential evolution (DE) algorithms called modified DE versions (CMDE, GMDE, and LMDE). Efficiency, which decides the operating or running cost of the motor (indus-try), is considered as the objective function. First, the algorithms are applied to design a general purpose motor with seven variables and nine performance-related parameters with their nominal values as constraints. To make the machine feasible, practically acceptable to serve in textile indus-tries, and less costly to operate, certain constraints are modified in accordance with the demands of the spinning application. Comparison of the optimum designs with the industrial (existing) motor reveals that the motor designed by the proposed algorithms consumes less power input. [ABSTRACT FROM AUTHOR]

Stochastic (or probabilistic) programming (SP) is an optimization technique in which the constraints and/or the objective function of an optimization problem contain random variables. The mathematical models of these problems may follow any particular probability distribution for model coefficients. The objective here is to determine the proper values for model parameters influenced by random events. In this study, two modified differential evolution (DE) algorithms namely, LDE1 and LDE2 are used for solving SP problems. Two models of SP problems are considered; Stochastic Fractional Programming Problems and Multiobjective Stochastic Linear Programming Problems. The numerical results obtained by the LDE algorithms are compared with the results of basic DE, basic particle swarm optimization (PSO) and the available results from where it is observed that the LDE algorithms significantly improve the quality of solution of the considered problem in comparison with the quoted results in the literature. [ABSTRACT FROM AUTHOR]

This paper presents a simple, hybrid two phase global optimization algorithm called DE-PSO for solving global optimization problems. DE-PSO consists of alternating phases of Differential Evolution (DE) and Particle Swarm Optimization (PSO). The algorithm is designed so as to preserve the strengths of both the algorithms. Empirical results show that the proposed DE-PSO is quite competent for solving the considered test functions as well as real life problems. [ABSTRACT FROM AUTHOR]

This article presents particle swarm optimization (PSO)-based optimal gain tuning of proportional integral (PI) speed controller in an induction motor (IM) drive (30 hp) with mine hoist load diagram. Optimization considers the load and speed variations, and provides appropriate gains to the speed controller to obtain good dynamic performance of the motor. IM performance is checked with the optimal gains through the simulation studies in MATLAB/SIMULINK environment. Results are compared with hand tuning (fixed gains) and fuzzy logic (FL) speed controller. Hybrid of FL and PSO-based PI controller for the speed control of given motor is also performed to eliminate the drawbacks of PI controller (overshoot and undershoot) and FL controller (steady-state error). From the simulation studies, hybrid controller produces better performance in terms of rise time, overshoot and settling time. [ABSTRACT FROM PUBLISHER]

Induction motor is the most frequently used electric machine in industrial and commercial applications because of its well-known advantages, including robustness, low price, maintenance free, and line start. The exact knowledge of some of the induction motor parameters is very important to implement efficient control schemes and its in situ efficiency determination. These parameters can be obtained by no-load test that is not easily possible for the motors working in process industries where continuous operation is required. In this present study, particle swarm optimization, differential evolution, and some of their recent variants are used for in situ efficiency determination of induction motor (5 hp) without performing no-load test. Detailed information about the methods for efficiency measurement is given. Results are compared with genetic algorithm and a physical efficiency measurement method, called torque-gauge method. The performances in terms of objective function (error in the efficiency) and convergence time prove the effectiveness of optimization algorithms used in this article. [ABSTRACT FROM AUTHOR]

Abstract: Optimization of directional over-current relay (DOCR) settings is an important problem in electrical engineering. The optimization model of the problem turns out to be non-linear and highly constrained in which two settings namely time dial setting (TDS) and plug setting (PS) of each relay are considered as decision variables; the sum of the operating times of all the primary relays, which are expected to operate in order to clear the faults of their corresponding zones, is considered as an objective function. In the present study, three models are considered namely IEEE 3-bus model, IEEE 4-bus model and IEEE 6-bus model. To solve the problem, we have applied five newly developed versions of differential evolution (DE) called modified DE versions (MDE1, MDE2, MDE3, MDE4, and MDE5). The results are compared with the classical DE algorithm and with five more algorithms available in the literature; the numerical results show that the modified DE algorithms outperforms or perform at par with the other algorithms. [Copyright &y& Elsevier]

Population based metaheuristics are commonly used for global optimization problems. These techniques depend largely on the generation of initial population. A good initial population may not only result in a better fitness function value but may also help in faster convergence. Although these techniques have been popular since more than three decades very little research has been done on the initialization of the population. In this paper, we propose a modified Particle Swarm Optimization (PSO) called Improved Constraint Particle Swarm Optimization (ICPSO) algorithm for solving constrained optimization. The proposed ICPSO algorithm is initialized using quasi random Vander Corput sequence and differs from unconstrained PSO algorithm in the phase of updating the position vectors and sorting every generation solutions. The performance of ICPSO algorithm is validated on eighteen constrained benchmark problems. The numerical results show that the proposed algorithm is a quite promising for solving constraint optimization problems. [ABSTRACT FROM AUTHOR]

This paper presents a variant of diversity guided Particle Swarm Optimization (PSO) algorithm named QIPSO for solving global optimization problems. In QIPSO the conventional framework of PSO is modified by including a crossover operator to maintain the level of diversity in the swarm population. Numerical results show that the induction of a crossover operator not only discourages premature convergence to the local optima but also explores promising regions of the search space effectively. Empirical results show the superior performance of QIPSO with conventional PSO and ARPSO. Efficiency of QIPSO is further validated by applying it to a set of five real life problems (RLPs) with constraints. Penalty method is used for dealing with constraints. Once again the simulation results show the compatibility of QIPSO for solving real life problems. [ABSTRACT FROM AUTHOR]