42 search results - page 8 / 9 » A Compressed-Annealing Heuristic for the Traveling Salesman ... |
AAIM
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
TRANSCI
2008
13 years 6 months ago
2008
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
FLAIRS
2006
13 years 7 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...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
COR
2010
13 years 6 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...