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

300
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...
300
The Availability Heuristic01:08

The Availability Heuristic

6.9K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
6.9K
The Representativeness Heuristic02:13

The Representativeness Heuristic

16.7K
The representative heuristic describes a biased way of thinking, in which you unintentionally stereotype someone or something. For example, you may assume that your professors spend their free time reading books and engaging in intellectual conversation, because the idea of them spending their time playing volleyball or visiting an amusement park does not fit in with your stereotypes of professors.
16.7K
The Anchoring-and-Adjustment Heuristic01:25

The Anchoring-and-Adjustment Heuristic

7.7K
In order to make good decisions, we use our knowledge and our reasoning. Often, this knowledge and reasoning is sound and solid. However, sometimes, we are swayed by biases or by others manipulating a situation. For example, let’s say you and three friends wanted to rent a house and had a combined target budget of $1,600. The realtor shows you only very run-down houses for $1,600 and then shows you a very nice house for $2,000. Might you ask each person to pay more in rent to get the...
7.7K
Heuristics01:21

Heuristics

671
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...
671
Routes of Persuasion02:20

Routes of Persuasion

68.5K
Persuasion is the process of changing our attitude toward something based on some kind of communication. Much of the persuasion we experience comes from outside forces. How do people convince others to change their attitudes, beliefs, and behaviors? What communications do you receive that attempt to persuade you to change your attitudes, beliefs, and behaviors?
68.5K

You might also read

Related Articles

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

Sort by
Same author

Interpretable prediction, classification and regulation of water quality: A case study of Poyang Lake, China.

The Science of the total environment·2024
Same author

A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.

Computational intelligence and neuroscience·2022
Same author

Solving the Family Traveling Salesperson Problem in the Adleman-Lipton Model Based on DNA Computing.

IEEE transactions on nanobioscience·2021
Same author

A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.

Bio Systems·2017
Same author

Magnetic resonance spectroscopy imaging (MRSI) and brain functional magnetic resonance imaging (fMRI) for radiotherapy treatment planning of glioma.

Technology in cancer research & treatment·2008
Same author

Chemoenzymatic synthesis of N-linked neoglycoproteins through a chitinase-catalyzed transglycosylation.

Bioorganic & medicinal chemistry·2008

Related Experiment Video

Updated: Jan 21, 2026

Structural Design and Manufacturing of a Cruiser Class Solar Vehicle
14:57

Structural Design and Manufacturing of a Cruiser Class Solar Vehicle

Published on: January 30, 2019

14.4K

A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton

Zhaocai Wang1, Xiaomin Ren1, Zuwen Ji2

  • 1College of Information, Shanghai Ocean University, Shanghai 201306, PR China.

Bio Systems
|August 2, 2019
PubMed
Summary
This summary is machine-generated.

This study introduces DNA computing algorithms to solve the capacitated vehicle routing problem, a complex computational challenge. The novel biocomputing approach offers a more efficient solution for this NP-hard problem.

Keywords:
Adleman–Lipton modelCapacitated vehicle routing problemDNA computingNP-hard problem

More Related Videos

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.7K
Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.7K

Related Experiment Videos

Last Updated: Jan 21, 2026

Structural Design and Manufacturing of a Cruiser Class Solar Vehicle
14:57

Structural Design and Manufacturing of a Cruiser Class Solar Vehicle

Published on: January 30, 2019

14.4K
A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.7K
Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.7K

Area of Science:

  • Interdisciplinary research at the intersection of computational mathematics, parallel algorithms, and bioinformatics.
  • Exploration of DNA computing as a novel paradigm for complex problem-solving.

Background:

  • The capacitated vehicle routing problem (CVRP) is an NP-hard optimization problem crucial for logistics.
  • Traditional computational methods face challenges in efficiently solving complex NP-hard problems like CVRP.

Purpose of the Study:

  • To propose parallel biocomputing algorithms for solving the capacitated vehicle routing problem using DNA computing.
  • To enhance the application scope of biocomputing and reduce computational complexity for optimization problems.

Main Methods:

  • Development of bio-heuristic computing models and DNA molecular manipulation techniques.
  • Representation of graph components (vertices, edges, weights) using biological chains.
  • Application of biological operations to search for solutions with a time complexity of O(n^2).

Main Results:

  • Successful implementation of parallel DNA algorithms for CVRP.
  • Demonstration of reduced computational complexity compared to existing methods.
  • Verification of the practicability of DNA parallel algorithms through simulations.

Conclusions:

  • DNA computing offers a viable and efficient approach for tackling complex NP-hard problems like CVRP.
  • The proposed biocomputing algorithms expand the utility of DNA computing in computational science.
  • Simulations confirm the effectiveness and potential of DNA-based parallel algorithms in logistics optimization.