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

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

Optimization Problems

195
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...
195
Limits to Natural Selection01:38

Limits to Natural Selection

36.2K
Organisms that are well-adapted to their environment are more likely to survive and reproduce. However, natural selection does not lead to perfectly adapted organisms. Several factors constrain natural selection.
36.2K
Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model01:13

Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model

405
Drugs administered through various routes can lead to nonlinear elimination, resulting in complex pharmacokinetic behaviors crucial to understanding efficacious drug dosing.
When a drug is administered through a constant intravenous infusion and eliminated via nonlinear pharmacokinetics, it follows zero-order input. For example, oral drugs undergo first-order absorption upon administration and are eliminated through nonlinear pharmacokinetics.
In the case of subcutaneously administered drugs,...
405
Methods of Medium Optimization01:28

Methods of Medium Optimization

63
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...
63
Parametric Survival Analysis: Weibull and Exponential Methods01:14

Parametric Survival Analysis: Weibull and Exponential Methods

1.3K
Parametric survival analysis models survival data by assuming a specific probability distribution for the time until an event occurs. The Weibull and exponential distributions are two of the most commonly used methods in this context, due to their versatility and relatively straightforward application.
Weibull Distribution
The Weibull distribution is a flexible model used in parametric survival analysis. It can handle both increasing and decreasing hazard rates, depending on its shape parameter...
1.3K

You might also read

Related Articles

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

Sort by
Same author

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games.

Algorithmica·2026
Same author

Autoantibodies to IL-1Ra and PGRN in severe COVID-19 are associated with inflammation-induced hyperphosphorylated antigen isoforms.

Nature communications·2026
Same author

Plasmacytic markers as immunotherapeutic targets for primary CD20-negative aggressive B-cell lymphomas.

British journal of haematology·2026
Same author

The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms.

Algorithmica·2026
Same author

Reprogramming of stroma-derived chemokine networks drives the loss of tissue organization in nodal B cell lymphoma.

Nature cancer·2026
Same author

Impact of Perforin 1 A91V germ line background in patients with aggressive B-NHL treated with R-CHOP.

Blood advances·2026
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: Apr 17, 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

13.6K

A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.

Dogan Corus1, Per Kristian Lehre2, Frank Neumann3

  • 1School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, UK psxdc1@nottingham.ac.uk.

Evolutionary Computation
|February 21, 2015
PubMed
Summary
This summary is machine-generated.

This study analyzes evolutionary algorithms for bi-level optimization problems, specifically the generalized minimum spanning tree and traveling salesperson problems. Results show specific representations enable fixed-parameter tractability for these NP-hard problems.

Keywords:
Bi-level optimisationcombinatorial optimisation.evolutionary algorithms

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

12.4K
Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.7K

Related Experiment Videos

Last Updated: Apr 17, 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

13.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

12.4K
Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.7K

Area of Science:

  • Combinatorial Optimization
  • Algorithm Analysis
  • Computational Complexity

Background:

  • Bi-level optimization problems are increasingly important in combinatorial optimization.
  • Analyzing the runtime of evolutionary algorithms is crucial for understanding their efficiency.
  • Parameterised complexity offers a framework to analyze algorithm performance on NP-hard problems.

Purpose of the Study:

  • To analyze the runtime of evolutionary algorithms for bi-level optimization problems.
  • To investigate the parameterised complexity of the generalized minimum spanning tree and traveling salesperson problems.
  • To evaluate the effectiveness of different solution representations for evolutionary algorithms.

Main Methods:

  • Examined two NP-hard problems: generalized minimum spanning tree and generalized traveling salesperson.
  • Analyzed evolutionary algorithm performance concerning the number of clusters and solution representation.
  • Applied parameterised complexity theory to assess fixed-parameter tractability.

Main Results:

  • For the generalized minimum spanning tree problem, the global structure representation allows fixed-parameter time solutions, unlike the spanning nodes representation.
  • The two analyzed approaches for the generalized minimum spanning tree problem are complementary, efficiently solving each other's hard instances.
  • A (1+1) evolutionary algorithm with global structure representation is a fixed-parameter evolutionary algorithm for the generalized traveling salesperson problem.

Conclusions:

  • The choice of solution representation significantly impacts the fixed-parameter tractability of evolutionary algorithms for bi-level optimization.
  • Global structure representation is effective for achieving fixed-parameter solutions for both generalized minimum spanning tree and traveling salesperson problems.
  • Understanding parameterised complexity is key to developing efficient evolutionary algorithms for complex optimization tasks.