A memetic neural network for the Euclidean traveling salesman problem

Authors:
Jean-Charles Créput;Abderrafiãa Koukam
Affiliations:
Systems and Transportation Laboratory, University of Technology of Belfort-Montbeliard, 90010 Belfort, France;Systems and Transportation Laboratory, University of Technology of Belfort-Montbeliard, 90010 Belfort, France
Venue:
Neurocomputing
Year:
2009

Citing 21
Cited 11

Computational geometry: an introduction

Computational geometry: an introduction
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition
The guilty net for the traveling salesman problem

Computers and Operations Research - Special issue on neural networks and operations research
Applying evolutionary programming to selected traveling salesman problems

Cybernetics and Systems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

Neural Networks
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software
The co-adaptive neural network approach to the Euclidean travelling salesman problem

Neural Networks
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Journal of Heuristics
Local search study of honeycomb clustering problem for cellular planning

International Journal of Mobile Network Design and Innovation
A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing

Neural Computation
Automatic mesh generation for mobile network dimensioning using evolutionary approach

IEEE Transactions on Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues

IEEE Transactions on Evolutionary Computation
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A new adaptive multi-start technique for combinatorial global optimizations

Operations Research Letters
An argument for abandoning the travelling salesman problem as a neural-network benchmark

IEEE Transactions on Neural Networks

Competitive Hopfield network combined with estimation of distribution for maximum diversity problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
The wise experiencing traveling salesman (WETS): introduction to a simple evolutionary solution for the problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem

Expert Systems with Applications: An International Journal
Approximate solution of the multiple watchman routes problem with restricted visibility range

IEEE Transactions on Neural Networks
An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Neurocomputing
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Applied Soft Computing
On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain

Information Sciences: an International Journal
A modified inver-over operator for the traveling salesman problem

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem

Neurocomputing
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem

Computers & Mathematics with Applications
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the hybridization of the self-organizing map (SOM) in an evolutionary algorithm to solve the Euclidean traveling salesman problem (TSP). The evolutionary dynamics consist of interleaving the SOM execution with a mapping operator, a fitness evaluation and a selection operator. SOM and mapping operators have a similar structure based on closest point findings and simple moves performed in the plane. We evaluate the approach on standard TSP test problems and show that it performs better, with respect to solution quality and/or computation time, than other neural network approaches given previously in the literature. Experiments are conducted on 91 publicly available TSP instances with up to 85900 cities.