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

Quadratic Equations

Quadratic Equations

A quadratic equation is an algebraic expression where a variable is raised to the second power and combined with its first power and a constant; all equated to zero. These equations are frequently used to model relationships involving area, motion, and optimization. The general representation of a quadratic equation iswhere a, b, and c are real values, and a is nonzero to ensure the presence of the squared term.One method for solving a quadratic equation involves rewriting it as a product of...

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

Quadratic Models

Quadratic Models

Quadratic models are mathematical representations used to describe relationships in which the rate of change changes at a constant rate. These models appear in a wide variety of natural and engineered systems, especially those involving motion, forces, and optimization. One common application is analyzing the vertical motion of objects influenced by gravity, such as a ball thrown into the air.In such scenarios, the object's height changes over time in a curved pattern, rising to a maximum point...

Quadratic Equations in the Complex Number System

Quadratic Equations in the Complex Number System

A quadratic equation in the form ax2+bx+c=0 can have solutions that vary in nature depending on the value of the discriminant, b2−4ac. In this expression, a is the coefficient of the quadratic term x2, b is the coefficient of the linear term x, and c is the constant term. When the discriminant is negative, the equation has no real number solutions. However, by introducing complex numbers through the imaginary unit i, defined by i=-1, these equations can still be solved.The square root of a...

Biot-Savart Law: Problem-Solving

Biot-Savart Law: Problem-Solving

The magnitude and direction of a magnetic field created by a steady current can be calculated using the Biot-Savart law.
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

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

You might also read

Related Articles

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

Sort by

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

Search research articles

Related Experiment Videos

Solving the quadratic assignment problem with clues from nature.

¹Interdisziplinares Graduiertenkolleg, Gottingen.

IEEE Transactions on Neural Networks

|January 1, 1994

Summary

This summary is machine-generated.

A novel evolutionary algorithm, based on evolution strategies (ES), effectively solves complex quadratic assignment problems. This approach outperforms standard heuristics like 2-Opt, simulated annealing, and tabu search.

Related Experiment Videos

Area of Science:

Operations Research
Computer Science
Artificial Intelligence

Background:

Quadratic assignment problems (QAPs) are computationally challenging combinatorial optimization problems.
Evolution strategies (ES) are bio-inspired optimization algorithms successful in continuous domains.

Purpose of the Study:

To introduce a new combinatorial variant of evolution strategies (ES) for solving quadratic assignment problems (QAPs).
To evaluate the performance of the proposed ES approach against established heuristics for QAPs.

Main Methods:

Development of a combinatorial evolution strategy (ES) tailored for quadratic assignment problems (QAPs).
Comparative analysis using standard 2-Opt heuristic, simulated annealing, and tabu search algorithms on test instances.

Main Results:

The proposed combinatorial ES demonstrated superior performance on the tested quadratic assignment problems (QAPs).
The ES approach showed significant improvements compared to the 2-Opt heuristic, simulated annealing, and tabu search.

Conclusions:

Evolution strategies (ES) offer a powerful and effective method for tackling complex quadratic assignment problems (QAPs).
The developed technique shows promise for practical applications, such as optimizing factory layouts.