A novel mixed Spider’s web initial solution and data envelopment analysis for solving multi-objective optimization problems

Abstract

When it comes to solving engineering design problems, the existing techniques require a significant amount of time. In the following case the objective function value has been obtained using optimization methods which has been the subject of many research efforts, recently accepted methods possess advantages however the biggest challenge is the number of objective functions and constraints required. In this paper, we proposed a novel combined approach involving the method of Data Envelopment Analysis and the Spider’s web initial solution. It turns out that the selected method requires no additional algorithm and can be used to solve most multi-objective problems, in contrast to previous methods in which the number of objective functions increase due to a rising level of complexity in such algorithms thereby leading to a reduction in effectiveness. Furthermore the proposed method is capable of yielding a more efficient result in non-convex problems as well as typical convex problems.