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. |
---|---|
Format: | text |
Published: |
Animo Repository
2017
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/1562 https://animorepository.dlsu.edu.ph/context/faculty_research/article/2561/type/native/viewcontent |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
Solving traveling salesman problems using generalized chromosome genetic algorithm
by: Yang, J., et al.
Published: (2014) -
Solving traveling salesman problems by genetic algorithms
by: Liang, Y., et al.
Published: (2014) -
Evolutionary algorithms for solving multi-objective travelling salesman problem
by: Shim, V.A., et al.
Published: (2014) -
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
by: Teoh, E.J., et al.
Published: (2014) -
A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem
by: Shim, V.A., et al.
Published: (2014)