An improved self-organizing map approach to traveling salesman problem

Proceedings - 2003 IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, RISSP 2003

Volumn 2003-October, Issue , 2003, Pages 674-679

  Zhu, Anmin ^a   Yang, S X ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; INTELLIGENT SYSTEMS; MOTION PLANNING; NETWORK LAYERS; ROBOT PROGRAMMING; ROBOTICS; SELF ORGANIZING MAPS; SIGNAL PROCESSING;

MULTIPLE TRAVELING SALESMAN PROBLEMS; NEIGHBORHOOD FUNCTION; ORGANIZING MAP; OUTPUT LAYER; ROBOT PATH-PLANNING; SELF ORGANIZING MAP ALGORITHM; WEIGHT UPDATE;

TRAVELING SALESMAN PROBLEM;

EID: 84990997280     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RISSP.2003.1285655     Document Type: Conference Paper

References (22)

1. K. Mehrotra, C. K. Mohan, and S. Ranka, Elements of artificial neural network, Mass, Cambridge, 1997.
2. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations Research, vol. 21, pp. 498-516, 1973.
3. G. Gutin, "Exponential neighbourhood local search for the traveling salesman problem," Computers and Operations Research, vol. 26, pp. 313-320, 1999.
4. K. T. Mak and A. J. Morton, "A modified linkernighan traveling-salesman heuristic," Operations Research Letters, vol. 13, no. 3, pp. 127-32, 1993.
5. B. Braschi, "Solving the travelling salesman problem using the simulated annealing on a hypercube," Proceedings of the Fourth Conference on Hypercubes, Concurrent Computers and Applications, vol. 2, pp. 765-768, 1989.
6. F. Ferstl and G. Thurner, "On a parallelized branch and bound implementation to solve the general travelling salesman problem," Methods of Operations Research, vol. 62, pp. 455-458, 1990.
7. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin, 1996.
8. K. Katayama, H. Sakamoto, and H. Narihisa, "The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem," Mathematical and Computer Modelling, vol. 31, no. 10-12, pp. 179-203, May-June 2000.
9. N. Toma, S. Endo, K. Yamada, and H. Miyagi, "The immune distributed competitive problem solver with major histocompatibility complex and immune network," in Proceeding of the IEEE International Conference on System, Man and Cybernetics, Nashville, October 2000, vol. 3, pp. 1865-1870.
10. M. Dorigo and L. M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53-66, 1997.
11. T. Stutzle and H. H. Hoos, "The max-min ant system and local search for the traveling salesman problem," in Proceedings of the IEEE International Conference on Evolutionary Computation, Indianapolis, April 1997, pp. 309-314.
12. B. Wu and Z. Shi, "An ant colony algorithm based partition algorithm for tsp," Chinese Journal of Computers, vol. 24, no. 12, pp. 1328-1333, December 2001.
13. S. Tsubakitani and J. R. Evans, "Optimizing tabu list size for the traveling salesman problem," Computers and Operations Research, vol. 25, pp. 91-97, 1998.
14. E. Merida-Casermeiro, G. Galan-Marin, and J. Munoz-Perez, "An efficient multivalued hopfield network for the traveling salesman problem," Neural Processing Letter, vol. 14, pp. 203-216, 2001.
15. R. Duribn and D. Willshaw, "An analogue approach to the traveling salesman problem using an elastic net method," Nature, vol. 326, pp. 689-691, 1987.
16. M. Al-Mulhem and T. Al-Maghrabi, "Efficient convex-elastic net algorithm to solve the euclidean traveling salesman problem," IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 28, no. 4, pp. 618-620, August 1998.
17. A. Modares, S. Somhom, and T. Enkawa, "A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems," International Transactions in Operational Research, vol. 6, no. 6, pp. 591-606, 1999.
18. L. Burke and P. Damany, "The guilty net for the traveling salesman problem," Computer and Operations Research, vol. 19, pp. 255-265, 1992.
19. S. Bhide, N. John, M. R., and Kabuka, "A boolean neural network approach for the traveling salesman problem," IEEE Transactions on Computers, vol. 42, no. 10, pp. 1271-1278, 1993.
20. N. Kanou, "Current-mode chaotic neuron circuit for the traveling salesman problem," Electronics and Communications in Japen Part III Fundamental Electronic Science, vol. 82, pp. 52-62, 1999.
21. K. T. Sun and H. C. Fu, "A hybrid neural network model for solving optimization problems," IEEE Transactions on Computers, vol. 42, no. 2, pp. 218-227, 1993.
22. T. Kohonen, Self-Organizing Maps, Springer, Berlin, 1995.