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

Efficient and scalable Pareto optimization by evolutionary local selection algorithms.

F Menczer1, M Degeratu, W N Street

  • 1Management Sciences Department, University of Iowa, Iowa City 52242, USA. filippo-menczer@uiowa.edu

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

Competition among memes in a world with limited attention.

Scientific reports·2012
Same author

An adaptive resource-allocating network for automated detection, segmentation, and classification of breast cancer nuclei topic area: image processing and recognition.

IEEE transactions on neural networks·2008
Same author

Topical interests and the mitigation of search engine bias.

Proceedings of the National Academy of Sciences of the United States of America·2006
Same author

Importance of nuclear morphology in breast cancer prognosis.

Clinical cancer research : an official journal of the American Association for Cancer Research·1999
Same author

Computer-derived nuclear features compared with axillary lymph node status for breast carcinoma prognosis.

Cancer·1997
Same author

Indeterminate fine-needle aspiration of the breast. Image analysis-assisted diagnosis.

Cancer·1997
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

Local selection, an evolutionary computation method, maintains diversity efficiently for multiobjective problems. The ELSA algorithm using local selection significantly outperforms other evolutionary algorithms in experiments.

Area of Science:

  • Evolutionary Computation
  • Artificial Intelligence
  • Optimization Algorithms

Background:

  • Local selection is a novel evolutionary computation scheme.
  • It compares individual fitnesses to a threshold for reproduction.
  • This method maintains diversity and is efficient for parallel processing.

Purpose of the Study:

  • Introduce ELSA, an evolutionary algorithm utilizing local selection.
  • Evaluate ELSA's performance on multiobjective problems.
  • Compare ELSA against established evolutionary algorithms.

Main Methods:

  • Implemented local selection within the ELSA algorithm.
  • Applied ELSA to a multimodal graph search problem.
  • Tested ELSA on two Pareto optimization problems.

Related Experiment Videos

Main Results:

  • ELSA demonstrated superior performance across all tested multiobjective problems.
  • Local selection proved effective in maintaining population diversity.
  • The algorithm showed significant improvements over existing methods.

Conclusions:

  • ELSA, powered by local selection, is a highly effective algorithm for multiobjective optimization.
  • Local selection offers an efficient and scalable approach for evolutionary computation.
  • Further research into distributed applications and parameter tuning is warranted.