18 search results - page 1 / 4 » The bi-objective covering tour problem |
104
Voted
COR
2000
14 years 11 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
COR
2007
14 years 11 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
ALENEX
2001
15 years 1 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
113
click to vote
DCOSS
2011
Springer
13 years 11 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
91
Voted
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...