ML Anthology

Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem

Carsten Peterson
NeCo 1990 pp. 261-269
doi:10.1162/NECO.1990.2.3.261 /neco/1990/peterson1990neco-parallel/

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.

NeCo Semantic Scholar

Cite

Text

Peterson. "Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem." Neural Computation, 1990. doi:10.1162/NECO.1990.2.3.261

Markdown

[Peterson. "Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem." Neural Computation, 1990.](https://mlanthology.org/neco/1990/peterson1990neco-parallel/) doi:10.1162/NECO.1990.2.3.261

BibTeX

@article{peterson1990neco-parallel,
  title     = {{Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem}},
  author    = {Peterson, Carsten},
  journal   = {Neural Computation},
  year      = {1990},
  pages     = {261-269},
  doi       = {10.1162/NECO.1990.2.3.261},
  volume    = {2},
  url       = {https://mlanthology.org/neco/1990/peterson1990neco-parallel/}
}