Neuro-immune approach to solve routing problems

Authors:
Thiago A. S. Masutti;Leandro N. de Castro
Affiliations:
Laboratory of Intelligent Systems (LSIn), Catholic University of Santos (UNISANTOS), 144, Dr. Carvalho de Mendonça St., Vila Mathias, Santos/SP, 11070-906, Brazil;Graduate Program in Electrical Engineering, Mackenzie University, R. da Consolação, 896 São Paulo/SP, 01302-907, Brazil
Venue:
Neurocomputing
Year:
2009

Citing 16
Cited 2

An optimal solution method for large-scale multiple traveling salesmen problems

Operations Research
The guilty net for the traveling salesman problem

Computers and Operations Research - Special issue on neural networks and operations research
Competition-based neural network for the multiple travelling salesmen problem with minmax objective

Computers and Operations Research - Special issue on the traveling salesman problem
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

Neural Networks
How to solve it: modern heuristics

How to solve it: modern heuristics
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Self-Organizing Maps

Self-Organizing Maps
An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

Neural Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Artificial Immune Systems: A New Computational Intelligence Paradigm

Artificial Immune Systems: A New Computational Intelligence Paradigm
Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research

INFORMS Journal on Computing
The co-adaptive neural network approach to the Euclidean travelling salesman problem

Neural Networks
Fundamentals of Natural Computing (Chapman & Hall/Crc Computer and Information Sciences)

Fundamentals of Natural Computing (Chapman & Hall/Crc Computer and Information Sciences)
A Constructive Self-Organizing Network Applied to a Discrete Optimization Problem

ISDA '07 Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A theoretical investigation into the performance of the Hopfield model

IEEE Transactions on Neural Networks

QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Journal of Network and Computer Applications
An evolutionary constructive and pruning algorithm for artificial neural networks and its prediction applications

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Routing problems constitute an important class of problems because they are hard to solve and have a wide variety of real-world applications. Two of the most well-studied routing problems are the traveling salesman problem (TSP) and the multiple traveling salesmen problem (MTSP). This paper proposes the use of a neuro-immune self-organizing network to solve both, TSP and MTSP. The algorithms are introduced and a brief review of the literature on self-organizing networks, applied separately to each of these problems, is performed. To assess the performance of the proposed algorithms, a number of tests are conducted on benchmark data, and the results are directly compared with those of similar works. The results obtained show a better performance in terms of the best solution found for many instances, and an equivalent average performance. The main advantages of the proposed approach are its network constructive architecture and the use of a single growing network to solve the MTSP.