A hybrid search algorithm with Hopfield neural network and Genetic algorithm for solving traveling salesman problem

In this paper, a hybrid search algorithm with Hopfield neural network (HNN) and Genetic algorithm (GA) is proposed. The HNN method is first used to generate valid solutions which are considered as solutions for initial population of genetic algorithm. Then, GA is used to perform exploitation around the best solution at each evaluation. The proposed algorithm has both the advantages of HNN and GA that can explore the search space and exploit the best solution. Experimental results demonstrate that the proposed algorithm does not get stuck at a local optimum.

[1]  Evangelos A. Yfantis,et al.  An OCR-independent character segmentation using shortest-path in grayscale document images , 2007, ICMLA 2007.

[2]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[3]  Licheng Jiao,et al.  A novel genetic algorithim based on immunity , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[4]  Zhen Jin,et al.  An new self-organizing maps strategy for solving the traveling salesman problem , 2006 .

[5]  Behrooz Kamgar-Parsi,et al.  On problem solving with Hopfield neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[6]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[7]  Gürsel Serpen,et al.  Hopfield Network as Static Optimizer: Learning the Weights and Eliminating the Guesswork , 2008, Neural Processing Letters.

[8]  Martin Zachariasen,et al.  Tabu Search on the Geometric Traveling Salesman Problem , 1996 .

[9]  Licheng Jiao,et al.  A novel genetic algorithm based on immunity , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[10]  Long Hu,et al.  An Improved Adaptive Genetic Algorithm for Job-Shop Scheduling Problem , 2007, Third International Conference on Natural Computation (ICNC 2007).

[11]  Sanghamitra Bandyopadhyay,et al.  New operators of genetic algorithms for traveling salesman problem , 2004, ICPR 2004.

[12]  Zhou Tao.  TSP Problem Solution Based on Improved Genetic Algorithm , 2008, 2008 Fourth International Conference on Natural Computation.

[13]  Mohammad-Bagher Naghibi-Sistani,et al.  A New Approach to Solve Traveling Salesman Problem Using Genetic Algorithm Based on Heuristic Crossover and Mutation Operator , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.

[14]  Shuyan Chen,et al.  A New Ant Evolution Algorithm to Resolve TSP Problem , 2007, Sixth International Conference on Machine Learning and Applications (ICMLA 2007).

[15]  Cheng-Fa Tsai,et al.  A modified multiple-searching method to genetic algorithms for solving traveling salesman problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[16]  Sanghamitra Bandyopadhyay,et al.  Genetic operators for combinatorial optimization in TSP and microarray gene ordering , 2007, Applied Intelligence.

[17]  Pedro M. Talaván,et al.  Parameter setting of the Hopfield network applied to TSP , 2002, Neural Networks.

[18]  Hamed Shah-Hosseini,et al.  Problem solving by intelligent water drops , 2007, 2007 IEEE Congress on Evolutionary Computation.