An Efficient Self-Organizing Map Designed by Genetic Algorithms for the Traveling Salesman Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 33, Issue 6, 2003, Pages 877-888

  Jin, Hui Dong ^a   Leung, Kwong Sak ^a   Wong, Man Leung ^b   Xu, Zong Ben ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b LINGNAN UNIVERSITY   (Hong Kong)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Convex hull; Genetic algorithms; Neural networks; Neural evolutionary system; Self organizing map; Traveling salesman problem

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; SELF ORGANIZING MAPS; VECTORS;

COMBINATORIAL OPTIMIZATION; CONVEX HULLS;

TRAVELING SALESMAN PROBLEM;

EID: 0345258465     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2002.804367     Document Type: Article

References (38)

1. S. Abe, "Convergence acceleration of the Hopfield neural network by optimization integration step sizes," IEEE Trans. Syst., Man, Cybern. B, vol. 26, pp. 194-201, 1996.
2. H. Al-Mulhem and T. Al-Maghrabi, "Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem," IEEE Trans. Syst., Man, Cybern. B, vol. 28, pp. 618-620, Aug. 1998.
3. B. Angèniol, G. D. L. C. Vaubois, and J. Y. L. Texier, "Self-organizing feature maps and the travelling salesman problem," Neural Netw., vol. 4, no. 1, pp. 289-293, 1988.
4. M. Budinich, "A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing," Neural Comput., vol. 8, pp. 416-424, 1996.
5. L. I. Burke and P. Damany, "The guilty net for the traveling salesman problem," Comput. Opt., vol. 19, pp. 255-265, 1992.
6. M. Chang, H. Yu, and J. Heh, "Evolutionary self-organizing map," in Proc. 1998 IEEE Int. Joint Conf. Neural Networks, vol. 1, 1998, pp. 680-685.
7. M. Dorigo and L. M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Trans. Evol. Comput., vol. 1, pp. 53-66, Apr. 1997.
8. R. Durbin and D. Willshaw, "An analogue approach to the traveling salesman problem," Nature (London), vol. 326, pp. 689-691, Apr. 1987.
9. F. Favata and R. Walker, "A study of the application of Kohonen-type neural networks to the traveling salesman problem," Biol. Cybern., vol. 64, pp. 463-468, 1991.
10. B. Fritzke and P. Wilke, "FLEXMAP - A neural network with linear time and space complexity for the traveling salesman problem," in Proc. IJCNN-90 Int. Joint Conf. Neural Networks, 1991, pp. 929-934.
11. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
12. B. Golden and W. Stewart et al., "Empirical analysis of heuristics," in The Travelling Salesman Problem, E. Lawler et al., Eds. New York: Wiley, 1985.
13. F. Guerrero, S. Lozano, D. Canca, J. M. Garcia, and K. A. Smith, "A new self-organizing neural network for solving the travelling salesman problem." in Eng. Syst. Design: Neural Networks, Fuzzy Logic, Evolutionary Programming, Data Mining, ComplexSystems, C. Dagli et al., Eds., 2001. vol. 11, pp. 865-870.
14. J. J. Hopfield and D. W. Tank, "'Neural' computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
15. D. S. Hwang and M. S. Han, "Two phase SOFM." in Proc. IEEE Int. Conf. Neural Networks, vol. 2, 1994, pp. 742-745.
16. H. D. Jin, K. S. Leung, and M. L. Wong, "An integrated self-organizing map for the traveling salesman problem," in Advances in Neural Networks and Applications, N. Mastorakis, Ed, Singapore: World Scientific, Feb. 2001, pp. 235-240.
17. D. S. Johnson and L. A. McGeoch, "The travelling salesman problem: A case study," in Local Search in Combinatorial Optimization, E. Aarts and J. Karel. Eds. New York: Wiley, 1997, pp. 215-310.
18. K. Katayama and H. Narihisa et al., "Iterated local search approach using genetic Transformation to the traveling salesman problem," in Proc. Genetic Evolutionary Computation Conf., vol. 1, W. Banzhaf et al., Eds., 1999, pp. 321-328.
19. S. G. Kirkpatrick, Jr., C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
20. J. Knox. "Tabu search performance on the symmetric traveling salesman problem," Comput. Oper. Res., vol. 21, pp. 867-876, 1994.
21. T. Kohonen, "Self-organized formation of topologically correct feature maps," Biol. Cybern., vol. 43, no. 2, pp. 59-69, 1982.
22. T. Kohonen, S. Kaski, K. Lagus, J. Salojärvi, V. Paatero, and A. Saarela, "Organization of a massive document collection," IEEE Trans. Neural Networks, vol. 11, pp. 574-585, May 2000.
23. N. Krasnogor and J. Smith et al., ''A memetic algorithm with self-adaptive local search: TSP as a case study," in Proc. Genetic Evolutionary Computation Conf., D. Whitley et al., Eds., 2000, pp. 987-994.
24. S. Kwong, C. W. Chau, K. F. Man, and K. S. Tang, "Optimization of HMM topology and its model parameters by genetic algorithms," Pattern Recognit., vol. 34, no. 2, pp. 509-522, Feb. 2001.
25. G. Laporte, "The vehicle routing problem: An overview of exact and approximate algorithms." Eur. J. Oper. Res., vol. 59, pp. 345-358, 1992.
26. K. S. Leung, H. D. Jin, and Z. B. Xu, "An expanding self-organizing neural network for the traveling salesman problem," Neural Netw., Aug. 2002. submitted for publication.
27. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.
28. A. S. Nissinen and H. Hyotyniemi, "Evolutionary training of behavior-based self-organizing map," in Proc. 1998 IEEE Int. Joint Conf. Neural Networks, vol. 1, 1998, pp. 660-665.
29. G. Reinelt, "TSPLIB - A traveling salesman problem library." ORSA J. Computing, vol. 3, no. 4, pp. 376-384, 1991.
30. K. A. Smith, "An argument for abandoning the travelling salesman problem as a neural network benchmark," IEEE Trans. Neural Networks, vol. 7, pp. 1542-1544, 1996.
31. K. A. Smith, "Neural networks for combinatorial optimization: A review of more than a decade of research," INFORMS J. Comput., vol. 11, no. 1, pp. 15-34, 1999.
32. M. C. Su and H. T. Chang, "Genetic-algorithms-based approach to self-organizing feature map and its application in cluster analysis," in Int. Joint Conf. Neural Networks Proc. IEEE World Congr. Computational Intelligence, vol. 1, 1998, pp. 735-740.
33. A. Y. C. Tang and K. S. Leung, "A modified edge recombination operator for the travelling salesman problem," Lecture Notes Computer Science, vol. 866, pp. 180-188, 1994.
34. S. Viswanathan, I. Ersoy, F. Bunyak, and C. Dagli, "Evolving neural networks applied to predator-evader problem," in Int. Joint Conf. Neural Networks, IJCNN'99, vol. 4, 1999, pp. 2394-2397.
35. C. Voudouris and E. Tsang, "Guided local search and its application to the traveling salesman problem," Eur. J. Oper. Res., vol. 113, no. 2, pp. 469-499, 1999.
36. G. Weiß, "Neural networks and evolutionary computation. Part I: Hybrid approaches in artificial intelligence," in Proc. First IEEE Conf. Evolutionary Computation, vol. 1, 1994, pp. 268-272.
37. Z. B. Xu, H. D. Jin, K. S. Leung, L. Leung, and C. K. Wong, "An automata network for performing combinatorial optimization," Neurocomputing, vol. 47, pp. 59-83, Aug. 2002.
38. X. Yao and Y. Liu, "Toward designing artificial neural networks by evolution," Appl. Math. Comput., vol. 91, no. 1, pp. 83-90, Apr. 1998.