Abstract

To provide an efficient multiobjective optimizer, an approximation technique based on the moving least squares approximation is integrated into an improved genetic algorithm. In order to use fully, both the a posteriori information gathered from the latest searched nondominated solutions and the a priori knowledge about the search space and individuals, in guiding the search towards more and better Pareto solutions, a gradient direction based perturbation search strategy and a preference function based fitness penalization scheme are proposed. Numerical results are reported to validate the proposed work

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.