Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

Optimal Foraging

Optimal Foraging

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.

Lagrange Multipliers: Problem Solving

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

Lagrange Multipliers: Two Constraints

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.

Gene Evolution - Fast or Slow?

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?

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

You might also read

Related Articles

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

Sort by

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

Search research articles

Related Experiment Video

Updated: Jun 12, 2026

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

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

Published on: December 9, 2012

Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem.

Christian Horoba¹

¹Fakultät für Informatik, TU Dortmund, 44221 Dortmund, Germany. horoba@ls2.cs.tu-dortmund.de

Evolutionary Computation

|June 22, 2010

Summary

This summary is machine-generated.

We developed a novel fitness function for the multi-objective shortest path problem. A simple evolutionary algorithm (EA) using this function achieves a fully polynomial-time randomized approximation scheme (FPRAS), demonstrating EA

More Related Videos

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

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

Published on: October 14, 2017

Related Experiment Videos

Last Updated: Jun 12, 2026

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

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

Published on: December 9, 2012

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

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

Published on: October 14, 2017

Area of Science:

Computer Science
Operations Research
Algorithm Analysis

Background:

The multi-objective shortest path problem is a fundamental NP-hard combinatorial optimization challenge.
Existing methods often struggle with the complexity and scale of multi-objective problems.

Purpose of the Study:

To introduce a natural vector-valued fitness function for the multi-objective shortest path problem.
To analyze the runtime performance of an evolutionary algorithm (EA) applied to this problem.

Main Methods:

Development of a vector-valued fitness function 'f'.
Rigorous runtime analysis of a simple evolutionary algorithm (EA) optimizing 'f'.
Theoretical analysis to establish approximation scheme bounds.

Main Results:

The evolutionary algorithm (EA) is shown to be a fully polynomial-time randomized approximation scheme (FPRAS).
Demonstration of EA's capability in finding approximate solutions for NP-hard problems.
Presentation of lower bounds for worst-case optimization time.

Conclusions:

A novel fitness function enables efficient approximation for a complex optimization problem.
Evolutionary algorithms offer a viable approach for tackling NP-hard multi-objective problems.
The study provides theoretical insights into the performance limits of such algorithms.