Constraint handling in multiobjective particle swarm optimization incorporating sensitivity analysis on constraint condition

被引：0
作者：
Kogiso, Nozomu [1 ]
Kawaji, Shoichiro [1 ]
Ohara, Masayoshi [1 ]
Ishigame, Atsushi [1 ]
Sato, Keiichi [1 ]
机构：
[1] Department of Aerospace Engineering, Osaka Prefecture University, Naka-ku, Sakai, Osaka, 599-8531
来源：
Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C | 2012年 / 78卷 / 785期
关键词：
Constraint handling; Hybrid method; Multiobjective optimization; Multiobjective particle swarm optimization; Sensitivity analysis;
D O I：
10.1299/kikaic.78.201
中图分类号：
学科分类号：
摘要：
A multi-objective particle swarm optimization (MOPSO) is known as a multiple point search-based meta-heuristic approach to find diverse Pareto solutions efficiently for design problem consisting of continuous design variables, but has difficulty to handle the constraint conditions. Overcoming the disadvantage, this study proposes a hybrid algorithm incorporating MOPSO and sensitivity analysis on constrained conditions. When design candidate with constraint violation appears during searching process, the design candidate is moved to the feasible domain using gradient information of the constraint conditions. Then, the design candidate is moved to the feasible boundary using the bi-section method. The forced transferee is applied to the design candidate in MOPSO algorithms. The proposed approach is different from the other hybrid approaches that the Pareto candidates are improved by local searching algorithms. Rather, the approach recovers the violated design candidate to the Pareto candidate by moving to the feasible boundary. This approach is useful for the design problem such as most structural design problems that the constraint sensitivity is easily obtained and that the Pareto sets will exist on the feasible boundary. Through several numerical examples, the diversity and convergency of the Pareto solutions as the performance of the proposed method are investigated. © 2012 The Japan Society of Mechanical Engineers.
引用
收藏
页码：201 / 213
页数：12
相关论文
共 29 条
  • [1] Deb K., Multi-objective Optimization Using Evolutionary Algorithms, (2001)
  • [2] Kennedy J., Eberhart R.C., Swarm Intelligence, (2001)
  • [3] Coello Coello C.A., Pulido G.T., Lechuga M.S., Handling multiple objectives with particle swarm optimization, IEEE Transactions on Evolutionary Computation, 8, 3, pp. 256-279, (2004)
  • [4] Reyes-Sierra M., Coello Coello C.A., Multi-objective particle swarm optimizers: A survey of the state-of-the-art, International Journal of Computational Intelligence Research, 2, 3, pp. 287-308, (2006)
  • [5] Durillo J.J., Garcia-Nieto J., Nebro A.J., Coello Coello C.A., Luna F., Alba E., Multi-objective particle swarm optimizers: An experimental comparison, Proceedings of the 5th International Conference on Evolutionary Multi-criterion Optimization, pp. 495-509, (2009)
  • [6] Particle Swarm Optimization, 20, 6, pp. 829-839, (2008)
  • [7] Nebro A.J., Durillo J.J., Garcia-Nieto J., Coello Coello C.A., Luna F., Alba E., SMPSO: A new PSO metaheuristic for multi-objective optimization, Proceedings of IEEE Symposium on Computational Intelligence in MCDM, pp. 66-73, (2009)
  • [8] Higashitani M., Ishigame A., Yasuda K., Particle swarm optimization considering the concept of predator-prey behavior, Proceedings of 2006 IEEE Congress on Evolutionary Computation, pp. 1541-1544, (2006)
  • [9] Coello Coello C.A., Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art, Computer Methods in Applied Mechanics and Engineering, 191, 11-12, pp. 1245-1287, (2002)
  • [10] Sienz J., Innocente M.S., Particle swarm optimization: Fundamental study and its application to optimization and to jetty scheduling problems, Trends in Engineering Computational Technology, pp. 103-126, (2008)
123