Abstract
In this paper, an improved particle swarm optimization (PSO) algorithm for robust optimization problems is proposed. The new algorithm, named robust particle swarm optimization (RPSO), deeps basic concepts of the PSO, results in dynamic determination of the robust optimal solution by using a 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> -quadrant-longest-distance expected fitness evaluation strategy in <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> -D space, and obtains robustness against the perturbation of design variables. The efficiency and advantages of the proposed algorithm are verified by the application to a mathematical function and a practical electromagnetic problem.
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.
