On the assessment of multiobjective approaches to the adaptive distributed database management problem

Joshua D. Knowles, David W. Come, Martin J. Oates

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

In this paper we assess the performance of three modern multiobjective evolutionary algorithms on a real-world optimization problem related to the management of distributed databases. The algorithms assessed are the Strength Pareto Evolutionary Algorithm (SPEA), the Pareto Archived Evolution Strategy (PAES), and M-PAES, which is a Memetic Algorithm based variant of PAES. The performance of these algorithms is compared using two distinct and sophisticated multiobjective-performance comparison techniques, and extensions to these comparison techniques are proposed. The information provided by the different performance assessment techniques is compared, and we find that, to some extent, the ranking of algorithm performance alters according to the comparison metric; however, it is possible to understand these differences in terms of the complex nature of multiobjective comparisons.

Original languageEnglish
Pages (from-to)869-878
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1917
DOIs
Publication statusPublished - 2000

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'On the assessment of multiobjective approaches to the adaptive distributed database management problem'. Together they form a unique fingerprint.

Cite this