Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Słowa kluczowe
Rocznik
Tom
Strony
61--71
Opis fizyczny
Bibliogr. 8 poz., rys., tab.
Twórcy
autor
- Poznan University of Technology 60-965 Poznań, ul. Piotrowo 3A
autor
- Institute of Electrical Engineering 04-703 Warszawa, ul. Pożaryskiego 28
Bibliografia
- [1] Dainone A., Parasiliti F., Villani M., Lucidi S.: A New Method for the Design Optimization of Three-Phase Induction Motors. I.E.E.E. Trans. on Magnetics, Vol. 34, No. 5, September 1998.
- [2] Dąbrowski M., Rudeński A.: Application of non-deterministic hybrid method for optimization of three-phase induction motors by increased number of independent variables. Poznan University of Technology Academic Journals, Electrical Engineering, No. 52, 2006, pp. 145-157.
- [3] Dąbrowski M., Rudeński A.: Research of feasible space structure in induction motors optimization. XLV International Symposium on Electrical Machines SME 2009, Krasiczyn, Zeszyty Problemowe BOBRME No. 82/2009, p. 123-128 (in Polish).
- [4] Michalewich Z.: Genetic Algorithms+DataStructures=Evolution Program. Springer Verlag, Heidelberg 1992.
- [5] Naelder J.A., Mead R.: A simplex method for function minimization. Comput. Journal, Vol. 7, No. 4, 1965, pp. 308-313.
- [6] Price W.I.: Global optimization by controlled random search. Journal of Optimization Theory and Application, 40 (1983) pp. 333-348.
- [7] Rudeński A.: Issues concerning penalty for constraints violation in design of optimal electrical machines using evolutionary methods. Przegląd Elektrotechniczny, Nr 12/2007, p. 73-78 (in Polishg).
- [8] Takahama T., Sakai S.: Constrained Optimization by Applying the a Constrained Method to the Nonlinear Simplex Method with Mutations. IEEE Trans, on Evolutionary Computation, Vol. 9, No. 3, October 2005, pp 437-450.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-a0f7a851-174f-45e9-9363-c38b55918e74