Scholars Central

Research articlePublished 2013

The performance research on solvingTSPby four typicalAI algorithms

Authors: Yue Wu, Zheng-qiang Jiang

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Travelling Salesmen Problem(VRP) has an important theoretical value and practical significance inmathematical and logistics field. It’s a typical NPHard problem, and artificial intelligent (AI) Algorithm has been already proven to be a very effect way in solving this problem. This paper carried out the performance research on solving TSP by four typicalAI algorithms after in-depth analyzed the TSP and these four algorithms (genetic algorithm, particle swarmoptimization algorithm, simulated annealing algorithmand ant colony algorithm). This paper verified the TSP solving performance by China travelling salesmen problem experiments and MATLAB programming. The results showed that: considering the average iteration time, SA < PSO< ACA

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in BioTechnology: An Indian Journal.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalBioTechnology: An Indian Journal
  • SubjectBiochemistry & Biotechnology
  • BylineArticles whose byline prints “Yue Wu”
  • BylineArticles whose byline prints “Zheng-qiang Jiang”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels