An argument for abandoning the traveling salesman problem as a neural-network benchmark

IEEE Transactions on Neural Networks

Volumn 7, Issue 6, 1996, Pages 1542-1544

  Smith, Kate ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000293428     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.548187     Document Type: Article

References (17)

1. J. J. Hopfield and D. W. Tank, "'Neural' computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
2. G. V. Wilson and G. S. Pawley, "On the stability of the TSP algorithm of Hopfield and Tank," Biol. Cybern., vol. 58, pp. 63-70, 1988.
3. R. D. Brandt, Y. Wang, A. J. Laub, and S. K. Mitra, "Alternative networks for solving the traveling salesman problem and the list-matching problem," in Proc. Int. Conf. Neual Networks, vol. 2, 1988, pp. 333-340.
4. D. E. Van den Bout and T. K. Miller, III, "A traveling salesman objective function that works," in Proc. IEEE Int. Conf. Neural Networks, vol. 2, 1988, pp. 299-303.
5. B. Kamgar-Parsi and B. Kamgar-Parsi, "Dynamical stability and parameter selection in neural optimization," in Proc. Int. Joint Conf. Neural Networks, vol. 4, 1992, pp. 566-571.
6. W. K. Lai and G. G. Coghill, "Genetic breeding of control parameters for the Hopfield/Tank neural net," in Proc. Int. Joint Conf. Neural Networks, vol. 4, 1992, pp. 618-623.
7. P. Chu, "A neural network for solving optimisation problems with linear equality constraints," in Proc. IEEE Int. Joint Conf. Neural Networks, vol. 2, 1992, pp. 272-277.
8. A. H. Gee, "Problem solving with optimization networks," Ph.D. dissertation, Queen's College, Cambridge, U.K., 1993.
9. A. H. Gee and R. W. Prager, "Limitations of neural networks for solving traveling salesman problems," IEEE Trans. Neural Networks, vol. 6, pp. 280-282, 1995.
10. R. Durbin and D. Willshaw, "An analog approach to the traveling salesman problem using an elastic net method," Nature, vol. 326, pp. 689-691, 1987.
11. J. T.-H. Lo, "A new approach to global optimization and its applications to neural networks," in Proc. Int. Joint Conf. Neural Networks, vol. IV, 1992, pp. 600-605.
12. D. E. Van den Bout and T. K. Miller, III, "Improving the performance of the Hopfield-Tank neural network through normalization and annealing." Biol. Cybern., vol. 62, pp. 129-139, 1989.
13. K. Smith, "Solving combinatorial optimization problems using neural networks," Ph.D. dissertation, Univ. Melbourne, Australia, 1996.
14. A. Joppe, H. R. A. Cardon, and J. C. Bioch, "A neural network for solving the traveling salesman problem," in Proc. Int. Joint Conf. Neural Networks, San Diego, CA, vol. III, 1990, pp. 961-964.
15. X. Xu and W. T. Tsai, "Effective neural algorithms for the traveling salesman problem," Neural Networks, vol. 4, pp. 193-205, 1991.
16. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Operations Res., vol. 21, pp. 498-516, 1973.
17. M. Ohlsson, C. Peterson, and B. Söderberg, "Neural networks for optimization problems with inequality constraints: The knapsack problem," Neural Computa., vol. 5, pp. 331-339, 1993.