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

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

Statically Indeterminate Problem Solving

355
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...
355
Mechanistic Models: Compartment Models in Individual and Population Analysis01:23

Mechanistic Models: Compartment Models in Individual and Population Analysis

24
Mechanistic models are utilized in individual analysis using single-source data, but imperfections arise due to data collection errors, preventing perfect prediction of observed data. The mathematical equation involves known values (Xi), observed concentrations (Ci), measurement errors (εi), model parameters (ϕj), and the related function (ƒi) for i number of values. Different least-squares metrics quantify differences between predicted and observed values. The ordinary least...
24
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

331
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
331
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

59
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
59
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

172
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
172

You might also read

Related Articles

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

Sort by
Same author

A network-based model to assess vaccination strategies for the COVID-19 pandemic by using Bayesian optimization.

Chaos, solitons, and fractals·2025
Same author

P-NP Instance Decomposition Based on the Fourier Transform for Solving the Linear Ordering Problem.

Evolutionary computation·2025
Same author

Neural Improvement Heuristics for Graph Combinatorial Optimization Problems.

IEEE transactions on neural networks and learning systems·2023
Same author

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

Evolutionary computation·2018

Related Experiment Video

Updated: May 27, 2025

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations
11:15

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

4.5K

On the Use of the Doubly Stochastic Matrix Models for the Quadratic Assignment Problem.

Valentino Santucci1, Josu Ceberio2

  • 1University for Foreigners of Perugia, Perugia, 06123, Italy valentino.santucci@unistrapg.it.

Evolutionary Computation
|February 20, 2025
PubMed
Summary

Doubly Stochastic Matrices (DSMs) offer an effective approach for solving complex permutation problems like the Quadratic Assignment Problem (QAP). Experiments show DSMs outperform other models in efficiency and computational performance for assignment and ordering tasks.

Keywords:
Doubly Stochastic MatrixEstimation of Distribution AlgorithmFourier transform.Ordering vs. Assignment ProblemsQuadratic Assignment Problem

More Related Videos

A Quantitative Fitness Analysis Workflow
11:39

A Quantitative Fitness Analysis Workflow

Published on: August 13, 2012

14.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.0K

Related Experiment Videos

Last Updated: May 27, 2025

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations
11:15

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

4.5K
A Quantitative Fitness Analysis Workflow
11:39

A Quantitative Fitness Analysis Workflow

Published on: August 13, 2012

14.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.0K

Area of Science:

  • Combinatorial Optimization
  • Computational Mathematics

Background:

  • Permutation problems are challenging in combinatorial optimization.
  • Existing methods for optimizing permutations vary significantly in their information utilization.

Purpose of the Study:

  • To propose and evaluate Doubly Stochastic Matrices (DSMs) within Estimation of Distribution Algorithms for permutation optimization.
  • To assess the effectiveness and efficiency of DSMs compared to other permutation models.

Main Methods:

  • Utilizing DSMs as a probabilistic model for permutations.
  • Developing efficient learning and sampling schemes for iterative probability model updates.
  • Conducting experiments on standard Quadratic Assignment Problem (QAP) benchmarks.

Main Results:

  • DSMs demonstrated superior effectiveness and computational efficiency over four other permutation models for the QAP.
  • DSMs show promise for assignment problems and ordering problems like the Linear Ordering Problem (LOP).

Conclusions:

  • DSMs are a valuable tool for assignment and ordering problems.
  • Potential applications of DSMs extend to other optimization paradigms like genetic algorithms and gradient search.