An adaptive divide-and-conquer methodology for evolutionary multi-criterion optimisation

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

Abstract

Improved sample-based trade-off surface representations for large numbers of performance criteria can be achieved by dividing the global problem into groups of independent, parallel sub-problems, where possible. This paper describes a progressive criterion-space decomposition methodology for evolutionary optimisers, which uses concepts from parallel evolutionary algorithms and nonparametric statistics. The method is evaluated both quantitatively and qualitatively using a rigorous experimental framework. Proof-of-principle results confirm the potential of the adaptive divide-and-conquer strategy. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Purshouse, R. C., & Fleming, P. J. (2003). An adaptive divide-and-conquer methodology for evolutionary multi-criterion optimisation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2632, 133–147. https://doi.org/10.1007/3-540-36970-8_10

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