332 search results - page 28 / 67 » Traveling salesman path problems |
GECCO
2009
Springer
14 years 15 days ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
ANTSW
2004
Springer
14 years 1 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
ICEC
1994
13 years 9 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
FLAIRS
2006
13 years 9 months ago
2006
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...