A feature-based comparison of evolutionary computing techniques for constrained continuous optimisation

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

Abstract

Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle swarm optimisation for constrained continuous optimisation. In our study, we examine how sets of constraints influence the difficulty of obtaining close to optimal solutions. Using a multi-objective approach, we evolve constrained continuous problems having a set of linear and/or quadratic constraints where the different evolutionary approaches show a significant difference in performance. Afterwards, we discuss the features of the constraints that exhibit a difference in performance of the different evolutionary approaches under consideration.

Cite

CITATION STYLE

APA

Poursoltan, S., & Neumann, F. (2015). A feature-based comparison of evolutionary computing techniques for constrained continuous optimisation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9491, pp. 332–343). Springer Verlag. https://doi.org/10.1007/978-3-319-26555-1_38

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