18 search results - page 1 / 4 » Improved Columnar Competitive Model for Travelling Salesman ... |
IJIIP
2010
13 years 2 months ago
2010
IJCNN
2006
IEEE
13 years 11 months ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
CCE
2004
13 years 5 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
EMO
2003
Springer
13 years 10 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
EOR
2006
13 years 5 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...