Abstract

In this article, a new approach is proposed to find Pareto optimum solutions for the benchmark TEAM problem by using a gradient-based optimization algorithm and an adaptive weight determination scheme. An air-cored multiturn winding problem with three conflicting objective functions is considered, and the solutions are obtained using the sensitivity information of the objective functions. Using the adaptive weight determination scheme, the values of the different weights are updated iteratively during the optimization process, and evenly distributed solutions are gradually obtained in the objective space. To evaluate the effectiveness of the proposed approach, the obtained solutions are quantitatively compared with those of the nondominated sorting genetic algorithm, and it is confirmed that more diverse and evenly distributed solutions could be obtained using the proposed approach.

Full Text
Published version (Free)

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