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

Statically Indeterminate Problem Solving

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

Heuristics

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

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

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

Mathematical Modeling: Problem Solving

Mathematical Modeling: Problem Solving

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

Stability of Equilibrium Configuration: Problem Solving

Stability of Equilibrium Configuration: Problem Solving

The stability of equilibrium configurations is an important concept in physics, engineering, and other related fields. In simple terms, it refers to the tendency of an object or system to return to its equilibrium position after being disturbed. The stability of an equilibrium configuration can be analyzed by considering the potential energy function of the system and examining its behavior near the equilibrium point.
Problem-solving in the context of the stability of equilibrium configuration...

You might also read

Related Articles

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

Sort by

Same author

Multiagent Deep Reinforcement Learning With Evolutionary Strategy for Mobile Charging Vehicles Dispatching.

IEEE transactions on neural networks and learning systems·2026

Same author

Identification of osteopontin as a urinary biomarker for autosomal dominant polycystic kidney disease progression.

Kidney research and clinical practice·2022

Same author

Complete sequences of mitochondrial genome of <i>Hypselodoris festiva</i> (A. Adams, 1861) (Mollusca, Gastropoda, Nudibranchia).

Mitochondrial DNA. Part B, Resources·2021

Same author

Complete mitochondrial genome sequences and phylogenetic relationship of <i>Elysia ornata</i> (Swainson, 1840) (Mollusca, Gastropoda, Heterobranchia, Sacoglossa).

Mitochondrial DNA. Part B, Resources·2021

Same author

Expression and secretion of CXCL12 are enhanced in autosomal dominant polycystic kidney disease.

BMB reports·2019

Same author

A heuristic for disassembly planning in remanufacturing system.

TheScientificWorldJournal·2014

Search research articles

Related Experiment Video

Updated: May 1, 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

An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints.

Jinmo Sung¹, Bongju Jeong¹

¹Department of Information & Industrial Engineering, Yonsei University, 50 Yonsei-Ro, Seodaemaun-gu, Seoul 120-749, Republic of Korea.

Thescientificworldjournal

|April 5, 2014

Summary

This study introduces a novel evolutionary algorithm to solve the traveling salesman problem with precedence constraints efficiently. The new genetic operators ensure feasible solutions, enhancing computational performance for industrial applications.

Related Experiment Videos

Last Updated: May 1, 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

Area of Science:

Operations Research
Computer Science
Artificial Intelligence

Background:

The Traveling Salesman Problem (TSP) with precedence constraints is a complex combinatorial optimization problem.
It has significant industrial applications but poses challenges due to solution efficiency.
Existing methods often struggle with computational complexity and feasibility.

Purpose of the Study:

To propose a new evolutionary algorithm (EA) for efficiently solving the TSP with precedence constraints.
To enhance the search process for obtaining high-quality solutions.
To improve computational efficiency and solution feasibility.

Main Methods:

Development of a novel EA incorporating specialized genetic operators.
Genetic operators designed to guarantee the feasibility of solutions across generations.
Integration with a flexible adaptive searching strategy.
Computational experiments to evaluate algorithm performance.

Main Results:

The proposed EA demonstrates improved efficiency in solving the TSP with precedence constraints.
Genetic operators successfully maintained solution feasibility throughout the search process.
The adaptive searching strategy further enhanced computational performance.
Experimental results validate the algorithm's effectiveness.

Conclusions:

The new EA offers an efficient approach for the TSP with precedence constraints.
Feasibility-guaranteeing genetic operators are crucial for computational efficiency.
The algorithm shows promise for practical industrial applications requiring optimized routing.