The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem

Abstract

In this paper we consider the Euclidean Travelling Salesman Problem (ETSP). This is the problem of finding the shortest tour around a number of cities where the cities correspond to points in the Euclidean plane and the distances between cities are given by the usual Euclidean distance metric. We present a review of the literature with respect to neural… (More)
DOI: 10.1016/S0893-6080(03)00056-X

Topics

11 Figures and Tables

Cite this paper

@article{Cochrane2003TheCN, title={The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem}, author={E. M. Cochrane and John E. Beasley}, journal={Neural networks : the official journal of the International Neural Network Society}, year={2003}, volume={16 10}, pages={1499-525} }