A New Hybrid Algorithm for Traveler Salesman Problem based on Genetic Algorithms and Artificial Neural Networks | Zendy

Alireza Asadi | Zendy; Ali Naserasadi | Zendy; Zeinab Arab Asadi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Hybrid Algorithm for Traveler Salesman Problem based on Genetic Algorithms and Artificial Neural Networks

Author(s) -

Alireza Asadi,

Ali Naserasadi,

Zeinab Arab Asadi

Publication year - 2011

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/2945-3926

Subject(s) - computer science , travelling salesman problem , artificial neural network , algorithm , genetic algorithm , artificial intelligence , machine learning

Traveler Salesman Problem (TSP) is one the most famous and important problems in the field of operation research and optimization. This problem is a NP-Hard problem and it is aimed to find a minimum Hamiltonian cycle in a connected and weighed graph. In the last decades, many innovative algorithms have been presented to solve this problem but most of them are inappropriate and inefficient and have high complexity. In this paper, we combined Hopfield neural network with genetic algorithm to solve this problem, and showed that the results of the algorithm are more efficient that the other similar algorithms. General Terms Algorithms

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research