Solving traveling salesman problems based on artificial cooperative search algorithm

HIGHLIGHTS

• who: Solving Traveling Salesman Problems and collaborators from the School of Sciences, Xi`an University of Technology, Xi`an, China have published the research: Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm, in the Journal: Computational Intelligence and Neuroscience 1.2 of 11/04/2022
• what: In order to better solve the traveling salesman problem, this paper proposes a reverse artificial collaborative search algorithm based on sigmoid function.
• how: To solve this problem the following sigmoid function is introduced 1 y=. After 30 times of solution by SQACS and the abovementioned . . .
  

   

  

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

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

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