Investigation of effectiveness of α-constrained simplex method applied to design of optimal induction motors

The paper presents a modified nonlinear simplex algorithm with lexicographic order comparison of solutions and its application to the design of optimal induction motors. In the comparison of the solutions generated in the optimization process, both the objective function value and the additional parameter, called the satisfaction level of constraints, have been taken into account. The comparison method assigns some advantage degree to feasible solutions, thus allows for the control of this advantage degree during the optimization process. Special attention has been paid to the choice of the algorithm parameters and to the kind of the mutation operator. The presented algorithm has been implemented in the object-oriented software. Calculation results of the selected double-cage induction motors have been compared with the results obtained with the evolution strategy (μ+λ)-ES and with the hybrid algorithm assembled with the modified Price algorithm. An additional calculation experiment allows for the comparison of exploitation properties between the α-Constrained Simplex Method and the Modified Price Algorithm. As the investigations showed, the presented algorithm can be successively used for the optimization of the induction motors, however, with constraints, which are not very restrictive concerning respective functional parameters.