Abstract
The difficulty to solve many objective optimization problems (MaOP) with well-established Multi-objective Evolutionary Algorithms as NSGA-II (Non-dominated Sorting Genetic Algorithm-II) motivates this work to develop a new alternative for solving MaOP problems. Thus, this paper proposes a novel variant of Simulated Annealing (SA) as an alternative to solve MaOP problems, combining also the proposed SA with clustering reduction techniques and tabu search. A comparative analysis between the proposed algorithm and the reference algorithm NSGA-II is presented using the recognized test set DTLZ. Experimental results using different performance metrics prove the advantages of the proposed algorithm over a well-established state of the art algorithm as NSGA-II.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
