Abstract Views :142 |
PDF Views:4
Authors
Affiliations
1 Computer Science and Engineering Department, Giani Zail Singh PTU Campus,
Bathinda, IN
Source
Research Cell: An International Journal of Engineering Sciences, Vol 11 (2014), Pagination: 29-34
Abstract
The travelling salesman problem (TSP) is a nondeterministic Polynomial hard problem in combinatorial optimization studied in theoretical computer science and operations research. And to solve this problem we used two popular meta-heuristics method that used for optimization techniques; the first one is Ant Colony Optimization (ACO), and the second is Genetic Algorithm (GA). In this work, we try to apply both techniques to solve TSP by using the same dataset and compare between them to determine the best one for travelling salesman problem.
Keywords
Ant Colony Optimization, Genetic Algorithm, Travelling Salesman Problem, Wireless Sensor Networks.
Full Text