Ciencias ambientales: una revista india
ISSN (PRINT):0974-7451

Abstracto

The performance research on solvingTSPby four typicalAI algorithms

Yue Wu, Zheng-qiang Jiang


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


Descargo de responsabilidad: este resumen se tradujo utilizando herramientas de inteligencia artificial y aún no ha sido revisado ni verificado.

Indexado en

  • CAS
  • Google Académico
  • Abrir puerta J
  • Infraestructura Nacional del Conocimiento de China (CNKI)
  • CiteFactor
  • Cosmos SI
  • Directorio de indexación de revistas de investigación (DRJI)
  • Laboratorios secretos de motores de búsqueda
  • Factor de impacto del artículo académico (SAJI))
  • ICMJE

Ver más

Revista ISSN

Índice h de la revista

Flyer

Revistas de acceso abierto