Journal
APPLIED SOFT COMPUTING
Volume 34, Issue -, Pages 862-873Publisher
ELSEVIER
DOI: 10.1016/j.asoc.2015.06.011
Keywords
Euclidean traveling salesman problem; Artificial neural network; Parallelization; Self-organized map; TSPLIB
Ask authors/readers for more resources
We investigate a parallelized divide-and-conquer approach based on a self-organizing map (SOM) in order to solve the Euclidean traveling salesman problem (TSP). Our approach consists of dividing cities into municipalities, evolving the most appropriate solution from each municipality so as to find the best overall solution and, finally, joining neighborhood municipalities by using a blend operator to identify the final solution. We evaluate performance of parallelized approach over standard TSP test problems (TSPLIB) to show that our approach gives a better answer in terms of quality and time rather than the sequential evolutionary SOM. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available