203 search results - page 3 / 41 » Biogeography Migration Algorithm for Traveling Salesman Prob... |
76
Voted
NETWORKS
1998
15 years 2 months ago
1998
142
Voted
ICICIC
2006
IEEE
15 years 8 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
113
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
156
Voted
ANTSW
2010
Springer
15 years 20 days ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
140
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...