A parallel dna algorithm for solving the quota traveling salesman problem based on biocomputing model

HIGHLIGHTS

  • who: Zhaocai Wang et al. from the College of Information, Shanghai Ocean University, Shanghai, China have published the research: A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model, in the Journal: Computational Intelligence and Neuroscience of 31/08/2022
  • what: The authors develop a DNA algorithm based on Adleman-Lipton model to solve the quota traveling salesman problem. The innovation of this study is to propose a polynomial time complexity algorithm to solve the QTSP.
  • how: To standardise and facilitate the expression and understanding of the algorithm . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?