30 search results - page 1 / 6 » An improved discrete bat algorithm for symmetric and asymmet... |
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
HIS
2008
13 years 5 months ago
2008
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
ICEC
1996
13 years 5 months ago
1996
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
ICEC
1996
13 years 5 months ago
1996
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...