Abstract
A new Non-dominated Sorting (NS) algorithm is presented in this paper to improve the efficiency of Genetic Algorithms (GAs) in solving multiobjective optimisation problems. Commonly used NS algorithms typically have a time complexity of O(MN?) to obtain a set of N non-dominated solutions for M objectives. In the proposed NS algorithm, a new dominance tree structure and a divide-and-conquer mechanism are adopted to reduce the number of redundant comparisons in determining non-dominated solutions. The new algorithm is implemented into Non-dominated Sorting Genetic Algorithm (NSGA)-II and shown to have improved overall efficiency of the entire evolution processes. By combining with the metamodelling technique, the new algorithm is successfully used in the multiobjective design of a vehicular structure for safety improvement and weight reduction.
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.
