4 search results - page 1 / 1 » Solving Very Large Traveling Salesman Problems by SOM Parall... |
PDCAT
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
COR
2006
13 years 4 months ago
2006
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
HPDC
1997
IEEE
13 years 8 months ago
1997
IEEE
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
IWINAC
2005
Springer
13 years 10 months ago
2005
Springer
The evolutionary algorithms can be considered as a powerful and interesting technique for solving large kinds of control problems. However, the great disadvantage of the evolutiona...