Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms
This paper aims to provide a comparative study of the different artificial intelligence (AI) algorithms applied to solve the traveling salesman problem (TSP). Four (4) AI algorithms such as genetic algorithm, nearest neighbor, ant colony optimization, and neuro-fuzzy are executed in MatLab software...
Saved in:
Main Authors: | Brucal, Stanley Glenn E., Dadios, Elmer P. |
---|---|
格式: | text |
出版: |
Animo Repository
2017
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/1562 https://animorepository.dlsu.edu.ph/context/faculty_research/article/2561/type/native/viewcontent |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | De La Salle University |
相似書籍
-
Solving traveling salesman problems using generalized chromosome genetic algorithm
由: Yang, J., et al.
出版: (2014) -
Solving traveling salesman problems by genetic algorithms
由: Liang, Y., et al.
出版: (2014) -
Evolutionary algorithms for solving multi-objective travelling salesman problem
由: Shim, V.A., et al.
出版: (2014) -
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
由: Teoh, E.J., et al.
出版: (2014) -
A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem
由: Shim, V.A., et al.
出版: (2014)