Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks

Authors:
Samuel A. Mulder;Donald C. Wunsch, II
Affiliations:
Applied Computational Intelligence Lab, Department of Computer Science, University of Missouri-Rolla, Rolla, MO;Applied Computational Intelligence Lab, Department of Electrical and Computer Engineering, University of Missouri-Rolla, Rolla, MO
Venue:
Neural Networks - 2003 Special issue: Advances in neural networks research — IJCNN'03
Year:
2003

Citing 3
Cited 8

The ART of Adaptive Pattern Recognition by a Self-Organizing Neural Network

Computer
Introduction to algorithms

Introduction to algorithms
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)

2009 Special Issue: MicroRNA expression profile based cancer classification using Default ARTMAP

Neural Networks
Using default ARTMAP for cancer classification with microRNA expression signatures

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Analysis of hyperspectral data with diffusion maps and fuzzy ART

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
ART properties of interest in engineering applications

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Application notes: memetic mission management

IEEE Computational Intelligence Magazine
BARTMAP: A viable structure for biclustering

Neural Networks
Reducing dimensionality of hyperspectral data with diffusion maps and clustering with k-means and Fuzzy ART

International Journal of Systems, Control and Communications
Adaptive Resonance Theory: How a brain learns to consciously attend, learn, and recognize a changing world

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-complete, and is an often-used benchmark for new optimization techniques. One of the main challenges with this problem is that standard, non-AI heuristic approaches such as the Lin-Kernighan algorithm (LK) and the chained LK variant are currently very effective and in wide use for the common fully connected, Euclidean variant that is considered here. This paper presents an algorithm that uses adaptive resonance theory (ART) in combination with a variation of the Lin-Kernighan local optimization algorithm to solve very large instances of the TSP. The primary advantage of this algorithm over traditional LK and chained-LK approaches is the increased scalability and parallelism allowed by the divide-and-conquer clustering paradigm. Tours obtained by the algorithm are lower quality, but scaling is much better and there is a high potential for increasing performance using parallel hardware.