A new multi-objective model for constrained optimisation

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multi-objective optimization evolutionary algorithms have becoming a promising approach for solving constrained optimization problems in the last decade. Standard two-objective schemes aim at minimising the objective function and the degrees of violating constraints (the degrees of violating each constraint or their sum) simultaneously. This paper proposes a new multi-objective model for constrained optimization. The model keeps the standard objectives: the original objective function and the sum of the degrees of constraint violation. Besides them, other helper objectives are constructed, which are inspired from MOEA/D or Tchebycheff method for multi-objective optimization. The new helper objectives are weighted sums of the normalized original objective function and normalized degrees of constraint violation. The normalization is a major improvement. Unlike our previous model without the normalization, experimental results demonstrate that the new model is completely superior to the standard model with two objectives. This confirms our expectation that adding more help objectives may improve the solution quality significantly.

Cite

CITATION STYLE

APA

Xu, T., He, J., Shang, C., & Ying, W. (2017). A new multi-objective model for constrained optimisation. In Advances in Intelligent Systems and Computing (Vol. 513, pp. 71–85). Springer Verlag. https://doi.org/10.1007/978-3-319-46562-3_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free