Jove
Visualize
Contact Us

Related Concept Videos

Combinatorial Gene Control02:33

Combinatorial Gene Control

9.2K
Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
9.2K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

200
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...
200
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.6K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.6K
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

90
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
90
Mathematical Modeling: Problem Solving01:29

Mathematical Modeling: Problem Solving

154
Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...
154
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

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

You might also read

Related Articles

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

Sort by
Same author

Improving Voice Spoofing Detection Through Extensive Analysis of Multicepstral Feature Reduction.

Sensors (Basel, Switzerland)·2025
Same author

Genetic Algorithm for Feature Selection Applied to Financial Time Series Monotonicity Prediction: Experimental Cases in Cryptocurrencies and Brazilian Assets.

Entropy (Basel, Switzerland)·2024
Same author

An Experimental Analysis on Multicepstral Projection Representation Strategies for Dysphonia Detection.

Sensors (Basel, Switzerland)·2023
Same author

A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem.

Sensors (Basel, Switzerland)·2022
Same author

NE-Motion: Visual Analysis of Stroke Patients Using Motion Sensor Networks.

Sensors (Basel, Switzerland)·2021
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 Experiment Video

Updated: Dec 7, 2025

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

A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling

Monique Simplicio Viana1, Orides Morandin Junior1, Rodrigo Colnago Contreras2

  • 1Department of Computing, Federal University of São Carlos, São Carlos, SP 13565-905, Brazil.

Sensors (Basel, Switzerland)
|September 25, 2020
PubMed
Summary
This summary is machine-generated.

This study introduces an enhanced Genetic Algorithm (GA) to solve complex NP-Hard problems like the Job Shop Scheduling Problem (JSSP). The improved GA overcomes limitations of traditional methods, offering more effective solutions.

Keywords:
combinatorial optimizationgenetic algorithmjob shop scheduling problemlocal searchmulti-crossover

More Related Videos

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.3K
Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow
08:58

Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow

Published on: October 17, 2025

368

Related Experiment Videos

Last Updated: Dec 7, 2025

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.0K
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.3K
Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow
08:58

Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow

Published on: October 17, 2025

368

Area of Science:

  • Operations Research
  • Computer Science
  • Artificial Intelligence

Background:

  • NP-Hard problems, such as the Job Shop Scheduling Problem (JSSP), often lack analytical solutions, necessitating meta-heuristic approaches.
  • Genetic Algorithms (GAs) are common for JSSP but suffer from premature convergence and local optima.
  • Existing research focuses on local search and improved GA operators to enhance performance.

Purpose of the Study:

  • To propose a novel Genetic Algorithm (GA) designed to overcome the limitations of traditional JSSP solution methods.
  • To enhance the effectiveness of meta-heuristic approaches for NP-Hard optimization problems.

Main Methods:

  • Development of a new GA incorporating a generalized massive local search operator.
  • Integration of local search strategies into the traditional mutation operator.
  • Introduction of a novel multi-crossover operator, ensuring all operators possess local search capabilities.

Main Results:

  • The proposed GA demonstrated superior effectiveness in solving 58 JSSP instances across three case studies.
  • The enhanced operators successfully mitigated issues of premature convergence and local optima.
  • The new method outperformed traditional JSSP solution techniques.

Conclusions:

  • The developed GA offers a more robust and effective approach to solving the Job Shop Scheduling Problem.
  • The integration of advanced local search functionalities significantly improves meta-heuristic performance for NP-Hard problems.
  • This research contributes a valuable advancement in the field of optimization and scheduling.