332 search results - page 9 / 67 » Traveling salesman path problems |
ICNC
2009
Springer
14 years 2 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
EVOW
2009
Springer
13 years 5 months ago
2009
Springer
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
CSJM
2006
13 years 7 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
NCA
2008
IEEE
13 years 7 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...
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
12 years 11 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...