Many design problems in engineering have highly nonlinear constraints and the proper handling of such constraints can be important to ensure solution quality. There are many different ways of handling constraints and different algorithms for optimization problems, which makes it difficult to choose for users. This paper compares six different constraint-handling techniques such as penalty methods, barrier functions, ϵ -constrained method, feasibility criteria and stochastic ranking. The pressure vessel design problem is solved by the flower pollination algorithm, and results show that stochastic ranking and ϵ -constrained method are most effective for this type of design optimization.
CITATION STYLE
He, X. S., Fan, Q. W., Karamanoglu, M., & Yang, X. S. (2019). Comparison of Constraint-Handling Techniques for Metaheuristic Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11538 LNCS, pp. 357–366). Springer Verlag. https://doi.org/10.1007/978-3-030-22744-9_28
Mendeley helps you to discover research relevant for your work.