Optimal design of induction machine using interval algorithms

Abstract

Purpose

The purpose of this paper is to present two optimization methodologies based on interval branch‐and‐bound algorithm.

Design/methodology/approach

These techniques decrease the total time of computation, even in spite of discrete nature of some of the design variables. Computational experiments performed on multivariable optimization problem reveal great accuracy and technical validity of developed approaches. As an example, the optimal design of the induction machine (IM) was treated, where the aim was to find the set of the most efficient and, at the same time, cheapest in the manufacturing configurations.

Findings

In this paper, two approaches were developed for resolving the problem of optimal design of IM with discrete variables. The strategy of constructing the meta‐models is utilized and put in practice. The methods show relatively high efficiency and robustness of obtained results.

Originality/value

These approaches are the core technics of the developed industrial application, which help identify the set of optimal configurations of IM with the criteria of optimality such as total cost of manufacturing and the efficiency of IM.

Citation

Samarkanov, D., Gillon, F., Brochet, P. and Laloy, D. (2012), "Optimal design of induction machine using interval algorithms", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 31 No. 5, pp. 1492-1502. https://doi.org/10.1108/03321641211248246