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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

437
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...
437
Optimization Problems01:26

Optimization Problems

214
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
214
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

6.2K
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...
6.2K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

2.5K
2.5K
Optimal Foraging00:48

Optimal Foraging

11.7K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
11.7K
Methods of Medium Optimization01:28

Methods of Medium Optimization

69
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
69

You might also read

Related Articles

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

Sort by
Same author

Context-dependent miRNA regulation in intervertebral disc degeneration: an IDD-focused dynamic network framework for stage-specific therapeutics.

Frontiers in cell and developmental biology·2026
Same author

Crystallographic Capture of a Free Triplet Borylnitrene.

Journal of the American Chemical Society·2026
Same author

OsMAPK20-1 and OsMAPK20-4 phosphorylate OsCK2β3 to regulate its stability in response to phosphate starvation in rice.

Plant physiology·2026
Same author

Intermediate strain rate constitutive modeling of gradient rolled vanadium-microalloyed pearlitic steel for bridge cables.

iScience·2026
Same author

A Combined Spectroscopic and Computational Study on the Electronic Structures of Cyclopentadienyl Bis-Phosphine Chromium(IV/V) Nitrides.

Inorganic chemistry·2026
Same author

Targeted silencing of CLYBL with platelet-mimetic siRNA nanoparticles drives itaconate-mediated macrophage reprogramming and protects against sepsis-triggered lung cell death.

Cell death discovery·2026
Same journal

Application of ephrin-B2 loaded glycol chitosan-silk fibroin hydrogel in the treatment of diabetic refractory wounds.

Scientific reports·2026
Same journal

International expert Delphi consensus on thromboprophylaxis in metabolic and bariatric surgery.

Scientific reports·2026
Same journal

Assessing the cross-region knowledge transfer capability of selected deep learning building vectorization methods in the context of available training datasets.

Scientific reports·2026
Same journal

Feasibility and preliminary effects of outdoor versus indoor cognitive-motor therapy in women with Alzheimer's disease: A randomized single-blind pilot study.

Scientific reports·2026
Same journal

Hallmarks of social action in the vocal turn-taking of wild common marmosets (Callithrix jacchus).

Scientific reports·2026
Same journal

Role and mechanism of AOPPs-induced NOX4-mediated ferroptosis in intervertebral disc degeneration.

Scientific reports·2026
See all related articles

Related Experiment Video

Updated: Apr 26, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

12.6K

Sequence sort: A new non-dominated sorting algorithm for evolutionary multi-objective optimization.

YunFei Yi1,2,3, Wang Chen4, YingJie Shi5

  • 1School of Computer Science and Engineering, Guangxi Normal University, Guilin, 541000, Guangxi, China. gxyiyf@163.com.

Scientific Reports
|April 24, 2026
PubMed
Summary
This summary is machine-generated.

Sequence Sort is a new algorithm for multi-objective evolutionary algorithms that efficiently sorts solutions. It significantly improves computational efficiency compared to existing methods, offering a reliable alternative for complex optimization problems.

Keywords:
Computational complexityEvolutionary algorithmsMulti-objective optimizationNon-dominated sortingPareto front

More Related Videos

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

11.0K

Related Experiment Videos

Last Updated: Apr 26, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

12.6K
The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

11.0K

Area of Science:

  • Computational Intelligence
  • Optimization Algorithms
  • Evolutionary Computation

Background:

  • Non-dominated sorting is essential for multi-objective evolutionary algorithms (MOEAs).
  • Existing algorithms face computational inefficiency and complexity, especially with more objectives.
  • This limits their scalability and practical application in solving complex problems.

Purpose of the Study:

  • To introduce Sequence Sort, a novel, efficient non-dominated sorting algorithm.
  • To address the limitations of existing algorithms in terms of computational efficiency and complexity.
  • To provide a reliable and scalable Pareto-based sorting method for MOEAs.

Main Methods:

  • Developed Sequence Sort, incorporating presorting and solution marking strategies.
  • Achieved a best-case computational complexity of O(N log N) for M objectives.
  • Compared Sequence Sort against established algorithms like Fast Non-dominated Sorting, Deductive Sorting, HNDS, Corner Sorting, and MNDS.

Main Results:

  • Sequence Sort demonstrates significant computational efficiency advantages over reference methods.
  • Experimental results confirm sorting outcomes consistent with established algorithms.
  • Statistical tests validate the significance of the performance improvements.

Conclusions:

  • Sequence Sort offers a computationally efficient and reliable alternative for non-dominated sorting in MOEAs.
  • The algorithm's performance is particularly notable as the number of objectives increases.
  • It presents a promising advancement for tackling complex multi-objective optimization challenges.