303 search results - page 6 / 61 » Traveling Salesman Problem with Transportation |
108
click to vote
NCA
2008
IEEE
14 years 9 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
90
Voted
FUN
2007
Springer
15 years 1 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
14 years 1 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
112
click to vote
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
The Traveling Salesman Problem Under Squared Euclidean Distances