Abstract

The switched reluctance machine (SRM) design is different from the design of most of other machines. SRM has many design parameters that have non-linear relationships with the performance indices (i.e., average torque, efficiency, and so forth). Hence, it is difficult to design SRM using straight forward equations with iterative methods, which is common for other machines. Optimization techniques are used to overcome this challenge by searching for the best variables values within the search area. In this paper, the optimization of SRM design is achieved using multi-objective Jaya algorithm (MO-Jaya). In the Jaya algorithm, solutions are moved closer to the best solution and away from the worst solution. Hence, a good intensification of the search process is achieved. Moreover, the randomly changed parameters achieve good search diversity. In this paper, it is suggested to also randomly change best and worst solutions. Hence, better diversity is achieved, as indicated from results. The optimization with the MO-Jaya algorithm was made for 8/6 and 6/4 SRM. Objectives used are the average torque, efficiency, and iron weight. The results of MO-Jaya are compared with the results of the non-dominated sorting genetic algorithm (NSGA-II) for the same conditions and constraints. The optimization program is made in Lua programming language and executed by FEMM4.2 software. The results show the success of the approach to achieve better objective values, a broad search, and to introduce a variety of optimal solutions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.