Ant colony system with heuristic function for the travelling salesman problem
Ant colony system which is classified as a meta-heuristic algorithm is considered as one of the best optimization algorithm for solving different type of NP-Hard problem including the travelling salesman problem.A heuristic function in the Ant colony system uses pheromone and distance values to prod...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/9849/1/J.pdf http://repo.uum.edu.my/9849/ http://dx.doi.org/10.4156/jnit.vol4.issue2.5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Ant colony system which is classified as a meta-heuristic algorithm is considered as one of the best optimization algorithm for solving different type of NP-Hard problem including the travelling salesman problem.A heuristic function in the Ant colony system uses pheromone and distance values to produce heuristic values in solving the travelling salesman problem.However, the heuristic values
are not updated in the entire process to reflect the knowledge discovered by ants while moving from city to city. This paper presents the work on enhancing the heuristic function in ant colony system in order to reflect the new information discovered by the ants.Experimental results showed that enhanced algorithm provides better results than classical ant colony system in term of best, average and standard of the best tour length. |
|---|