The self-organizing map (SOM) has been successfully employed to handle the Euclidean
traveling salesman problem (TSP). By incorporating its neighborhood preserving property …

Abstract The Travelling Salesman Problem (TSP) is one of the most well-known
combinatorial optimization problems and has attracted a lot of interests from researchers …

Traveling salesman problem (TSP) is one of the extensively studied combinatorial
optimization problems and tries to find the shortest route for salesperson which visits each …

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 …

This paper describes an artificial immune algorithm (IA) combined with estimation of
distribution algorithm (EDA), named IA‐EDA, for the traveling salesman problem (TSP). Two …

This paper proposes a parallel computation model for the self-organizing map (SOM) neural
network applied to Euclidean traveling salesman problems (TSP). This model is intended for …

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 …

This paper presents an intelligent environment developed for monitoring patients' health
care in execution time in hospital environments. The CBPMP (case-based planner for …

Both the clonal selection algorithm (CSA) and the ant colony optimization (ACO) are inspired
by natural phenomena and are effective tools for solving complex problems. CSA can exploit …

This paper presents a technique that uses the Wang recurrent neural network with the
“Winner Takes All” principle to solve the traveling salesman problem (TSP). When the Wang …