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 Concept Videos

Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Inclusive Fitness00:57

Inclusive Fitness

Most altruistic behavior—in which one animal helps another at a cost to themselves—occurs between relatives. Scientists think these altruistic behaviors evolved because they increase the inclusive fitness of the animal providing help.
Types of Selection01:46

Types of Selection

Natural selection influences the frequencies of particular alleles and phenotypes within populations in several different ways. Primarily, natural selection can be directional, stabilizing, or disruptive. Directional selection favors one extreme trait and shifts the population towards that phenotype while selecting against individuals displaying alternate traits. Stabilizing selection favors an intermediate trait with a narrow range of variation. Deviation from the optimal phenotype towards an...

You might also read

Related Articles

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

Sort by
Same author

Co-occurrence of microplastics and heavy metals in sediments of the Lanzhou section of the Yellow River: Distribution characterizations and comprehensive ecological risk assessment.

Marine pollution bulletin·2026
Same author

Theoretical model of impact mitigation mechanisms inherent to the North American bison skull.

Biology open·2024
Same author

The Function of Horn Ridges for Impact Damping.

Biomimetics (Basel, Switzerland)·2024
Same author

Examination of Cognitive Function, Neurotrophin Concentrations, and both Brain and Systemic Inflammatory Markers Following a Simulated Game of American Football.

Journal of strength and conditioning research·2022
Same author

State-of-the-Art Modeling and Simulation of the Brain's Response to Mechanical Loads.

Annals of biomedical engineering·2019
Same author

Mechanical Response of Porcine Liver Tissue under High Strain Rate Compression.

Bioengineering (Basel, Switzerland)·2019
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

Related Experiment Video

Updated: Jun 30, 2026

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

An efficient non-dominated sorting method for evolutionary algorithms.

Hongbing Fang1, Qian Wang, Yi-Cheng Tu

  • 1Department of Mechanical Engineering and Engineering Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA. hfang@uncc.edu

Evolutionary Computation
|September 25, 2008
PubMed
Summary
This summary is machine-generated.

A novel non-dominated sorting algorithm enhances evolutionary algorithms like NSGA-II by reducing redundant comparisons. This optimization significantly improves computational efficiency in multi-objective optimization problems.

Related Experiment Videos

Last Updated: Jun 30, 2026

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

Area of Science:

  • Computational Intelligence
  • Evolutionary Computation
  • Multi-Objective Optimization

Background:

  • The Non-dominated Sorting Algorithm II (NSGA-II) is a popular evolutionary algorithm for multi-objective optimization.
  • The efficiency of NSGA-II is often limited by the computational cost of its non-dominated sorting procedure, which has a time complexity of O(MN^2).
  • Improving the speed of non-dominated sorting can lead to significant performance gains in evolutionary multi-objective optimization.

Purpose of the Study:

  • To develop a new, faster non-dominated sorting algorithm for evolutionary multi-objective optimization.
  • To improve the overall efficiency of algorithms like NSGA-II by optimizing the non-dominated front generation process.
  • To reduce redundant comparisons in the sorting procedure.

Main Methods:

  • Introduction of a novel non-dominated sorting algorithm.
  • Utilization of a 'dominance tree' data structure.
  • Application of a 'divide-and-conquer' mechanism.
  • Recording dominance information from initial comparisons to avoid re-computation.

Main Results:

  • The proposed algorithm demonstrates improved efficiency compared to the standard NSGA-II algorithm across various numbers of objective functions.
  • While the number of solution comparisons can be similar to NSGA-II for many objectives, the overall computational time is reduced.
  • The dominance tree and divide-and-conquer strategies contribute to the enhanced efficiency.

Conclusions:

  • The new non-dominated sorting algorithm offers a significant speed improvement for NSGA-II and similar evolutionary algorithms.
  • The proposed method effectively reduces computational overhead in generating non-dominated fronts.
  • This advancement contributes to more efficient solutions for complex multi-objective optimization tasks.