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

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...
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
Lagrange Multipliers: Problem Solving01:30

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...
Heuristics01:21

Heuristics

Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...

You might also read

Related Articles

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

Sort by
Same author

A Constrained Learning-Based Competitive Swarm Optimizer for Large-Scale Multiobjective Optimization.

IEEE transactions on cybernetics·2025
Same author

Challenging the Limits of Binarization: A New Scheme Selection Policy Using Reinforcement Learning Techniques for Binary Combinatorial Problem Solving.

Biomimetics (Basel, Switzerland)·2024
Same author

Neural Net-Enhanced Competitive Swarm Optimizer for Large-Scale Multiobjective Optimization.

IEEE transactions on cybernetics·2023
Same author

Multiobjective Multitasking Optimization With Decomposition-Based Transfer Selection.

IEEE transactions on cybernetics·2023
Same author

A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis.

PeerJ. Computer science·2022
Same author

VSD-MOEA: A Dominance-Based Multiobjective Evolutionary Algorithm with Explicit Variable Space Diversity Management.

Evolutionary computation·2021
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 Videos

Computing gap free Pareto front approximations with stochastic search algorithms.

Oliver Schütze1, Marco Laumanns, Emilia Tantar

  • 1CINVESTAV-IPN, Departamento de Computación, México D.F., México. schuetze@cs.cinvestav.mx

Evolutionary Computation
|January 13, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces novel archiving strategies for stochastic search algorithms to achieve gap-free Pareto front approximations in multi-objective optimization. These methods ensure better solution set coverage, enhancing optimization performance.

Related Experiment Videos

Area of Science:

  • Computational Mathematics
  • Optimization Theory
  • Algorithm Design

Background:

  • Existing stochastic search algorithms provide Pareto set approximations for multi-objective optimization problems using epsilon-dominance.
  • Current methods, while offering convergence bounds, do not guarantee gap-free Pareto front approximations, potentially missing solutions.
  • Gap-free approximations are crucial for specific applications and can improve memetic algorithm performance.

Purpose of the Study:

  • To develop novel archiving strategies for stochastic search algorithms that ensure gap-free Pareto front approximations.
  • To provide probabilistic convergence proofs for the proposed strategies under mild assumptions.
  • To explore the integration of epsilon-dominance with multi-objective continuation methods.

Main Methods:

  • Development of two new archiving strategies for stochastic search algorithms.
  • Probabilistic convergence analysis and theoretical proofs.
  • Numerical simulations to visualize strategy performance and hybridization potential.

Main Results:

  • The proposed strategies successfully achieve gap-free Pareto front approximations in a probabilistic sense.
  • Convergence proofs demonstrate the theoretical validity of the new methods.
  • Numerical results illustrate the effectiveness of the strategies and their potential for hybridization.

Conclusions:

  • The novel archiving strategies effectively address the gap-free approximation challenge in multi-objective optimization.
  • The integration of epsilon-dominance with multi-objective continuation methods shows promise for enhanced search capabilities.
  • These advancements contribute to more comprehensive and reliable solution set exploration in complex optimization problems.