Solving Traveling Salesman Problem using combinational evolutionary algorithm
Bonyadi, Mohammad Reza, Rahimi Azghadi, S. Mostafa, and Shah Hosseini, Hamed (2007) Solving Traveling Salesman Problem using combinational evolutionary algorithm. In: Proceedings of the 4th IFIP International Conference on Artificial Intelligence Applications and Innovations (247) pp. 37-44. From: AIAI 2007: 4th IFIP International Conference on Artificial Intelligence Applications and Innovations, 19-21 September 2007, Athens, Greece.
PDF (Published Version)
- Published Version
Restricted to Repository staff only |
Abstract
In this paper, we proposed a new method to solve TSP (Traveling Salesman Problem) based on evolutionary algorithms. This method can be used for related problems and we found out the new method can works properly in problems based on permutation. We compare our results by the previous algorithms and show that our algorithm needs less time in comparison with known algorithms and so efficient for such problems.
Item ID: | 45724 |
---|---|
Item Type: | Conference Item (Research - E1) |
ISSN: | 1868-4238 |
Date Deposited: | 14 Feb 2017 03:55 |
FoR Codes: | 08 INFORMATION AND COMPUTING SCIENCES > 0801 Artificial Intelligence and Image Processing > 080108 Neural, Evolutionary and Fuzzy Computation @ 100% |
SEO Codes: | 97 EXPANDING KNOWLEDGE > 970108 Expanding Knowledge in the Information and Computing Sciences @ 100% |
Downloads: |
Total: 4 |
More Statistics |