Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

Fall 1990, Vol. 2, No. 3, Pages 261-269
(doi: 10.1162/neco.1990.2.3.261)
© 1990 Massachusetts Institute of Technology
Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem
Article PDF (414.61 KB)
Abstract

We present and summarize the results from 50-, 100-, and 200-city TSP benchmarks presented at the 1989 Neural Information Processing Systems (NIPS) postconference workshop using neural network, elastic net, genetic algorithm, and simulated annealing approaches. These results are also compared with a state-of-the-art hybrid approach consisting of greedy solutions, exhaustive search, and simulated annealing.