Learn More
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 problem consists of determining a set of total minimum length vehicle routes on a subset of <, subject to side constraints, such that every vertex of = is within a prespeci"ed distance from a route.(More)
  • 1