Solving Traveling Salesman Problem using combinational evolutionary algorithm

Conference Publication ResearchOnline@JCU

Bonyadi, Mohammad Reza;Rahimi Azghadi, S. Mostafa;Shah Hosseini, Hamed

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.

Journal

N/A

Publication Name

AIAI 2007: 4th IFIP International Conference on Artificial Intelligence Applications and Innovations

Volume

247

ISBN/ISSN

1868-4238

Edition

N/A

Issue

N/A

Pages Count

Location

Athens, Greece

Publisher

Springer

Publisher Url

N/A

Publisher Location

Boston, MA, USA

Publish Date

N/A

Url

N/A

Date

N/A

EISSN

N/A

DOI

10.1007/978-0-387-74161-1_5