Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Approximating the nondominated front using the Pareto Archived Evolution Strategy.

J D Knowles1, D W Corne

  • 1School of Computer Science, Cybernetics and Electronic Engineering, University of Reading, UK. J.D.Knowles@reading.ac.uk

Evolutionary Computation
|June 8, 2000
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Convergent evolution to an aptamer observed in small populations on DNA microarrays.

Physical biology·2010
Same author

Automated measurement of 14C in chromatographic peaks in the effluent of the amino acid analyzer.

Analytical biochemistry·1981
Same author

Preparative automated amino acid analysis: a new instrument permitting the exclusive collection of peaks.

Analytical biochemistry·1975
Same author

Proceedings: The kinetic response of HeLa cells to MAM acetate treatment.

British journal of cancer·1974

The Pareto Archived Evolution Strategy (PAES) is a simple yet effective algorithm for multiobjective optimization. PAES demonstrates consistent performance across various tasks, offering a strong baseline for comparison.

Area of Science:

  • Computational Intelligence
  • Optimization Algorithms
  • Evolutionary Computation

Background:

  • Multiobjective optimization problems (MOPs) require generating diverse solutions within the Pareto optimal set.
  • Existing algorithms like Niched Pareto Genetic Algorithm and Nondominated Sorting Genetic Algorithm have varying performance characteristics.

Purpose of the Study:

  • Introduce a novel, simple evolution scheme for MOPs: the Pareto Archived Evolution Strategy (PAES).
  • Establish PAES as a potential baseline for comparison with more complex multiobjective optimization methods.
  • Evaluate the performance of PAES variants against established algorithms on diverse test functions.

Main Methods:

  • The Pareto Archived Evolution Strategy (PAES) utilizes a (1 + 1) evolution strategy with local search and a reference archive.

Related Experiment Videos

  • PAES employs a reference archive to determine dominance ranking between current and candidate solutions.
  • Extended PAES variants, including (1 + lambda) and (mu + lambda), were developed and tested.

    • Main Results:

    • PAES variants demonstrated consistent and strong performance across a suite of six diverse test functions.
    • Comparative analysis showed PAES performing competitively against Niched Pareto Genetic Algorithm and Nondominated Sorting Genetic Algorithm variants.
    • Statistical analysis of attainment surfaces confirmed the robustness of PAES across multiple optimization runs.

    Conclusions:

    • The Pareto Archived Evolution Strategy (PAES) is a simple, effective, and robust algorithm for multiobjective optimization.
    • PAES offers a valuable baseline for evaluating more complex evolutionary multiobjective strategies.
    • The algorithm's simplicity and effectiveness make it suitable for real-world applications where local search is competitive.