An adaptive constraint-handling approach for optimization problems with expensive objective and constraints

Author(s):  
Jiaxiang Yi ◽  
Yuansheng Cheng ◽  
Jun Liu
2021 ◽  
Vol 67 (3) ◽  
pp. 2845-2862
Author(s):  
Muhammad Asif Jan ◽  
Yasir Mahmood ◽  
Hidayat Ullah Khan ◽  
Wali Khan Mashwani ◽  
Muhammad Irfan Uddin ◽  
...  

2018 ◽  
Vol 72 ◽  
pp. 14-29 ◽  
Author(s):  
Max de Castro Rodrigues ◽  
Solange Guimarães ◽  
Beatriz Souza Leite Pires de Lima

2017 ◽  
Vol 187 ◽  
pp. 77-87 ◽  
Author(s):  
Rafael de Paula Garcia ◽  
Beatriz Souza Leite Pires de Lima ◽  
Afonso Celso de Castro Lemonge ◽  
Breno Pinheiro Jacob

2015 ◽  
pp. 1246-1276
Author(s):  
Wen Fung Leong ◽  
Yali Wu ◽  
Gary G. Yen

Generally, constraint-handling techniques are designed for evolutionary algorithms to solve Constrained Multiobjective Optimization Problems (CMOPs). Most Multiojective Particle Swarm Optimization (MOPSO) designs adopt these existing constraint-handling techniques to deal with CMOPs. In this chapter, the authors present a constrained MOPSO in which the information related to particles' infeasibility and feasibility status is utilized effectively to guide the particles to search for feasible solutions and to improve the quality of the optimal solution found. The updating of personal best archive is based on the particles' Pareto ranks and their constraint violations. The infeasible global best archive is adopted to store infeasible nondominated solutions. The acceleration constants are adjusted depending on the personal bests' and selected global bests' infeasibility and feasibility statuses. The personal bests' feasibility statuses are integrated to estimate the mutation rate in the mutation procedure. The simulation results indicate that the proposed constrained MOPSO is highly competitive in solving selected benchmark problems.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Marco M. Rosso ◽  
Raffaele Cucuzza ◽  
Fabio Di Trapani ◽  
Giuseppe C. Marano

Firstly formulated to solve unconstrained optimization problems, the common way to solve constrained ones with the metaheuristic particle swarm optimization algorithm (PSO) is represented by adopting some penalty functions. In this paper, a new nonpenalty-based constraint handling approach for PSO is implemented, adopting a supervised classification machine learning method, the support vector machine (SVM). Because of its generality, constraint handling with SVM appears more adaptive both to nonlinear and discontinuous boundary. To preserve the feasibility of the population, a simple bisection algorithm is also implemented. To improve the search performances of the algorithm, a relaxation function of the constraints is also adopted. In the end part of this paper, two numerical literature benchmark examples and two structural examples are discussed. The first structural example refers to a homogeneous constant cross-section simply supported beam. The second one refers to the optimization of a plane simply supported Warren truss beam. The obtained results in terms of objective function demonstrate that this new approach represents a valid alternative to solve constrained optimization problems even in structural optimization field. Furthermore, as demonstrated by the Warren truss beam problem, this new algorithm provides an optimal structural design which represents also a good solution from the technical point of view with a trivial rounding-off that does not jeopardize significantly the optimization design process.


Sign in / Sign up

Export Citation Format

Share Document