Skip to main content

On the Assessment of Multiobjective Approaches to the Adaptive Distributed Database Management Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. M. Fonseca and P. J. Fleming. On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers. In H.-M. Voigt, W. Ebeling, I. Rechen-berg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature-PPSN IV, Lecture Notes in Computer Science, pages 584–593. Springer-Verlag, Berlin, Germany, September 1996.

    Chapter  Google Scholar 

  2. J. D. Knowles and D. W. Corne. The Pareto Archived Evolution Strategy: A New Baseline Algorithm for Multiobjective Optimisation. In 1999 Congress on Evolutionary Computation, pages 98–105, Piscataway, NJ, July 1999. IEEE Service Center.

    Google Scholar 

  3. J. D. Knowles and D. W. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2):149–172, 2000.

    Article  Google Scholar 

  4. J. D. Knowles and D. W. Corne. M-PAES: A Memetic Algorithm for Multiobjective Optimization. In Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), Piscataway, NJ, 2000. IEEE. (To appear).

    Google Scholar 

  5. M. Laumanns, G. Rudolph, and H.-P. Schwefel. Approximating the Pareto Set: Concepts, Diversity Issues, and Performance Assessment. Technical Report CI-72/99, University of Dortmund, March 1999.

    Google Scholar 

  6. W. Mendenhall and R. J. Beaver. Introduction to Probability and Statistics-9th edition. Duxbury Press, International Thomson Publishing, Pacific Grove, CA, 1994.

    Google Scholar 

  7. M. J. Oates and D. W. Corne. Investigating Evolutionary Approaches to Adaptive Database Management Against Various Quality of Service Metrics. In T. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature V, pages 775–784. Springer, 1998.

    Google Scholar 

  8. M. Pilegaard Hansen and A. Jaszkiewicz. Evaluating the quality of approximations to the non-dominated set. Technical Report IMM-REP-1998-7, Technical University of Denmark, March 1998.

    Google Scholar 

  9. D. A. V. Veldhuizen and G. B. Lamont. Multiobjective Evolutionary Algorithm Test Suites. In J. Carroll, H. Haddad, D. Oppenheim, B. Bryant, and G. B. Lamont, editors, Proceedings of the 1999 ACM Symposium on Applied Computing, pages 351–357, San Antonio, Texas, 1999. ACM.

    Google Scholar 

  10. E. Zitzler. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November 1999. (See pp. 44–45).

    Google Scholar 

  11. E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Technical Report 70, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, February 1999.

    Google Scholar 

  12. E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257–271, November 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knowles, J.D., Corne, D.W., Oates, M.J. (2000). On the Assessment of Multiobjective Approaches to the Adaptive Distributed Database Management Problem. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_85

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics