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 approximation for the variant where we have a fixed number of buses to use, and the goal is to minimize the maximum regret.
KeywordsTravelling Salesman Problem Junction Point Capacitate Vehicle Route Problem Euler Tour Core Segment
Unable to display preview. Download preview PDF.
- 2.Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In: STOC 1997 (1997)Google Scholar
- 4.Chekuri, C., Korula, N., Pal, M.: Improved Algorithms for Orienteering and Related Problems. In: SODA, pp. 661–670 (2008)Google Scholar
- 9.Nagarajan, V., Ravi, R.: Approximation Algorithms for Distance Constrained Vehicle Routing Problems. Tepper School of Business, Carnegie Mellon University, Pittsburgh (2008)Google Scholar
- 12.Toth, P., Vigo, D.: The Vehicle Routing Problem (2001)Google Scholar