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

Distance Problem01:29

Distance Problem

4
When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
4
Optimization Problems01:26

Optimization Problems

8
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
8
The Distance Formula01:20

The Distance Formula

559
In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...
559
Design Example: Measuring Distance Between Two Points with Obstructions01:10

Design Example: Measuring Distance Between Two Points with Obstructions

386
When measuring distances in areas with physical obstructions, such as a lake in a field, surveyors must employ techniques to calculate accurate lengths without direct line measurements. One effective method is the offset technique, which allows for precise distance estimation over inaccessible stretches.In this scenario, a surveyor must measure a side of an area that crosses a lake. Since the measuring tape cannot span the lake, the surveyor begins by establishing a baseline that aligns with...
386
Dot Product: Problem Solving01:21

Dot Product: Problem Solving

668
The dot product is a powerful tool in problem-solving involving vectors, given that the dot product of two vectors is the product of their magnitudes and the cosine of the angle between them measured anti-clockwise. Solving problems involving the dot product requires understanding its properties and developing a step-by-step process to solve them. Here are the main steps to follow when solving any general problem involving the dot product:
Identify the problem: Start by reading the problem and...
668
Biot-Savart Law: Problem-Solving00:59

Biot-Savart Law: Problem-Solving

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

You might also read

Related Articles

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

Sort by
Same author

Review of NEDDylation inhibition activity detection methods.

Bioorganic & medicinal chemistry·2020
Same author

Optimization of Process Parameters of Rhamnolipid Treatment of Oily Sludge Based on Response Surface Methodology.

ACS omega·2020
Same author

Safety and Long-term Scleral Biomechanical Stability of Rhesus Eyes after Scleral Cross-linking by Blue Light.

Current eye research·2020
Same author

Serum pentraxin 3 as a biomarker for prognosis of acute minor stroke due to large artery atherosclerosis.

Brain and behavior·2020
Same author

The roles of adenosine deaminase in autoimmune diseases.

Autoimmunity reviews·2020
Same author

The role of oxidative stress in association between disinfection by-products exposure and semen quality: A mediation analysis among men from an infertility clinic.

Chemosphere·2020
Same journal

Harmonic memory in phasor neural networks.

Biological cybernetics·2026
Same journal

Correction: Decreased spinal inhibition leads to undiversified locomotor patterns.

Biological cybernetics·2026
Same journal

Foundational issues of network models in biology.

Biological cybernetics·2026
Same journal

Dynamical mechanisms for coordinating long-term working memory based on the precision of spike-timing in cortical neurons.

Biological cybernetics·2026
Same journal

Distinct dopaminergic spike-timing-dependent plasticity rules are suited to different functional roles.

Biological cybernetics·2026
Same journal

Fluctuation-response relations for a two-stage population of spiking neurons stimulated by common noise.

Biological cybernetics·2026
See all related articles

Related Experiment Video

Updated: Jan 13, 2026

A System for Tracking the Dynamics of Social Preference Behavior in Small Rodents
08:38

A System for Tracking the Dynamics of Social Preference Behavior in Small Rodents

Published on: November 21, 2019

8.1K

Predatory search algorithm with restriction of solution distance.

Chong Liu1, Dingwei Wang

  • 1Institute of Systems Engineering, Northeastern University, Shenyang 110004, PR China. lch_24@hotmail.com

Biological Cybernetics
|April 20, 2005
PubMed
Summary
This summary is machine-generated.

A new predatory search algorithm uses solution distance for NP-Hard problems like the traveling salesman problem. This enhanced algorithm matches or surpasses the original in speed and solution quality.

More Related Videos

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.9K
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.4K

Related Experiment Videos

Last Updated: Jan 13, 2026

A System for Tracking the Dynamics of Social Preference Behavior in Small Rodents
08:38

A System for Tracking the Dynamics of Social Preference Behavior in Small Rodents

Published on: November 21, 2019

8.1K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.9K
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.4K

Area of Science:

  • Computational intelligence
  • Operations research
  • Algorithm design

Background:

  • NP-Hard problems require advanced computational methods.
  • Predatory search is an evolutionary computation algorithm inspired by animal behavior.
  • Original predatory search used solution cost for restriction, simplifying predator search behavior.

Purpose of the Study:

  • To explore using solution distance, specifically bond distance, to restrict the search area in predatory search algorithms.
  • To compare the performance of a distance-restricted predatory search algorithm against the original cost-restricted version.

Main Methods:

  • Developed a novel predatory search algorithm incorporating solution distance restrictions.
  • Applied both the original and the proposed algorithms to three benchmark traveling salesman problems.
  • Evaluated performance based on running time and solution quality.

Main Results:

  • Both algorithms effectively solve traveling salesman problems.
  • The proposed distance-restricted algorithm demonstrated superior or equivalent performance compared to the original.
  • The distance-restricted algorithm showed improvements in both running time and solution quality.

Conclusions:

  • The predatory search algorithm restricted by solution distance is a viable and effective method for solving NP-Hard problems.
  • Distance restriction offers advantages over cost restriction in predatory search, particularly for the traveling salesman problem.
  • A relationship exists between the cost-restricted and distance-restricted predatory search algorithms, warranting further investigation.