The School Bus Problem on Trees

The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to the school by more than a given regret threshold. Subject to this constraint and bus capacity limit, the goal is to minimize the number of buses required. In this paper, we give a polynomial time 4-approximation algorithm when the children and school are located at vertices of a fixed tree. As a byproduct of our analysis, we show that the integrality gap of the natural set-cover formulation for this problem is also bounded by 4. We also present a constant factor approximation for the variant where we have a fixed number of buses to use, and the goal is to minimize the maximum regret.


Published in:
Algorithmica -New York-
Year:
2012
Publisher:
New York, Springer Verlag
ISSN:
0178-4617
Keywords:
Laboratories:




 Record created 2013-06-20, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)