Two Multivehicle Routing Problems with Unit-Time Windows

Details Two Multivehicle Routing Problems with Unit-Time Windows Two Multivehicle Routing Problems with Unit-Time Windows

2011-01-20

arxiv.org/abs/1101.3953v1

Computer Science

Data Structures and Algorithms

7 pages

Scientific paper

Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to visit as many locations as possible using a fixed number of vehicles. In the second, the goal is to visit all locations using the smallest number of vehicles possible. For the first problem, we present an approximation algorithm whose output path collects a reward within a constant factor of optimal for any fixed number of vehicles. For the second problem, our algorithm finds a 6-approximation to the problem on a tree metric, whenever a single vehicle could visit all locations during their time windows.

Affiliated with

Also associated with

No associations

Rating

Two Multivehicle Routing Problems with Unit-Time Windows does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two Multivehicle Routing Problems with Unit-Time Windows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Multivehicle Routing Problems with Unit-Time Windows will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334279