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

Pareto Chart00:52

Pareto Chart

A Pareto chart is a bar graph or a combination of both line and bar graphs. The bar lengths represent the individual values or the frequency, while the lines represent the cumulative total values. In this chart, the longest bars are arranged on the left and the shortest bars on the right, which makes it easier to read and interpret the data. It can also be called a Pareto diagram or Pareto analysis.
The Pareto chart is named after the Italian economist Vilfredo Pareto, who described the Pareto...
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...
Optimization Problems01:26

Optimization Problems

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...
Methods of Medium Optimization01:28

Methods of Medium Optimization

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...
Decision Making: P-value Method01:09

Decision Making: P-value Method

The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim  is also stated. These statements can act as null and alternative hypotheses:  a null hypothesis would be a neutral statement while the alternative hypothesis can have a...
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures from...

You might also read

Related Articles

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

Sort by
Same author

Optimizing Latent Variables in Integrating Transfer and Query Based Attack Framework.

IEEE transactions on pattern analysis and machine intelligence·2024
Same author

Large-Scale Multiobjective Evolutionary Algorithm Guided by Low-Dimensional Surrogates of Scalarization Functions.

Evolutionary computation·2024
Same author

Nanopore sequencing improves construction of customized CRISPR-based gene activation libraries.

Biotechnology and bioengineering·2024
Same author

Phase Separation Modulates the Formation and Stabilities of DNA Guanine Quadruplex.

JACS Au·2023
Same author

Efficacy and safety of vorolanib plus everolimus in metastatic renal cell carcinoma: A three-arm, randomised, double-blind, multicentre phase III study (CONCEPT).

European journal of cancer (Oxford, England : 1990)·2022
Same author

Lipid-Based Intelligent Vehicle Capabilitized with Physical and Physiological Activation.

Research (Washington, D.C.)·2022
Same journal

An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models.

IEEE transactions on cybernetics·2026
Same journal

A Quantum Self-Attention Neural Network Model on Quantum Circuits.

IEEE transactions on cybernetics·2026
Same journal

Semi-Explicit Solution of Some Discrete-Time Higher-Order-Cost Mean-Field-Type Control.

IEEE transactions on cybernetics·2026
Same journal

A Novel One-Step Small Object Detector for Autonomous Aerial Vehicles.

IEEE transactions on cybernetics·2026
Same journal

Online Data-Driven-Based Optimal Output Tracking Control Without Initial Stabilizing Policy.

IEEE transactions on cybernetics·2026
Same journal

Digital Redesign-Based Interval State Estimation for Continuous Systems With Aperiodic Discrete Measurements.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: May 10, 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

Corner Sort for Pareto-Based Many-Objective Optimization.

Handing Wang, Xin Yao

    IEEE Transactions on Cybernetics
    |June 13, 2013
    PubMed
    Summary
    This summary is machine-generated.

    A new corner sort method significantly reduces comparisons for many-objective optimization problems. This efficient approach improves performance in multiobjective evolutionary algorithms (MOEAs), especially when dealing with numerous objectives.

    More Related Videos

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    Related Experiment Videos

    Last Updated: May 10, 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

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    Area of Science:

    • Optimization Algorithms
    • Computational Intelligence

    Background:

    • Nondominated sorting is crucial for Pareto-based multiobjective evolutionary algorithms (MOEAs).
    • Traditional nondominated sorting methods face computational challenges with many-objective optimization problems (MOPs) due to a large number of comparisons.

    Purpose of the Study:

    • To introduce a novel and efficient nondominated sorting method called corner sort.
    • To reduce the computational complexity of nondominated sorting in MOEAs, particularly for MOPs with many objectives.

    Main Methods:

    • Corner sort utilizes a fast method to identify nondominated solutions from corner solutions.
    • It leverages these nondominated solutions to efficiently prune dominated solutions, thereby minimizing objective comparisons.
    • Performance is evaluated against state-of-the-art nondominated sorting algorithms on artificial and MOEA-generated solution sets.

    Main Results:

    • Corner sort demonstrates strong performance, particularly on many-objective optimization problems.
    • The proposed method requires significantly fewer objective comparisons compared to existing approaches.
    • Experiments show corner sort's effectiveness across diverse solution set distributions and its positive influence on MOEA performance.

    Conclusions:

    • Corner sort offers a computationally efficient alternative for nondominated sorting in MOEAs.
    • It is especially beneficial for tackling many-objective optimization problems.
    • The method effectively reduces comparisons, enhancing the scalability of multiobjective optimization algorithms.