Abstract

In today’s world, the interest on multi-objective optimization through evolutionary algorithms (EAs) is growing day by day. However, most of the relative researches are confined within small scale with relatively fewer number of decision variables limited within 30, though real-world multi-objective optimization problems deal with, most of the times, with more than hundred decision variables. Also, optimization with fully separable decision variables along with non-separable decision variables leads to more optimal solutions than dealing with only any one of the both. In this paper, we have proposed an algorithm, which deals with medium- to large-scale multi-objective decision variables, compares the optimal solutions of separable and non-separable decision variables, and accepts the one having most optimized decision. Here we have adopted the test functions (large-scale multiobjective and many-objective optimization test problems for separable decision variables and Zitzler–Deb–Thiele test suit for non-separable decision variables) that are scalable with more than 100 decision variables and can range the results of both separable and non-separable decision variables.

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.