Multi-objective particle swarm optimization for robust optimization and its hybridization with gradient search

  • Authors:
  • Satoshi Ono;Shigeru Nakayama

  • Affiliations:
  • Department of Information and Computer Science, Faculty of Engineering, Kagoshima University, Japan;Department of Information and Computer Science, Faculty of Engineering, Kagoshima University, Japan

  • Venue:
  • CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an algorithm using Multi-objective Particle Swarm Optimization (MOPSO) for finding robust solutions against small perturbations of design variables. If an optimal solution is sensitive to small perturbations of variables, it may be inappropriate or risky for practical use. Robust optimization finds solutions which are moderately good in terms of optimality and also good in terms of robustness against small perturbations of variables. The proposed algorithm formulates robust optimization as a biobjective optimization problem, and finds robust solutions by searching for Pareto solutions of the bi-objective problem. This paper also proposes a hybridization of MOPSO and quasi-Newton method as an attempt to design effective memetic algorithm for robust optimization. Experimental results have shown that the proposed algorithms could find robust solutions effectively. The advantage and drawback of the hybridization were also clarified by the experiments, helping design an effective memetic algorithm for robust optimization.