The k-traveling repairman problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
Online and offline algorithms for the sorting buffers problem on the line metric
Journal of Discrete Algorithms
To fill or not to fill: The gas station problem
ACM Transactions on Algorithms (TALG)
Selecting good a priori sequences for vehicle routing problem with stochastic demand
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Online sorting buffers on line
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the vehicle routing problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Hardness of preemptive finite capacity dial-a-ride
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation Algorithms for Capacitated Location Routing
Transportation Science
| Hi-index | 0.00 |
Given n identical objects (pegs), placed at arbitrary initial locations, we consider the problem of transporting them efficiently to n target locations (slots) with a vehicle that can carry at most k pegs at a time. This problem is referred to as k-delivery TSP, and it is a generalization of the traveling salesman problem. We give a 5-approximation algorithm for the problem of minimizing the total distance traveled by the vehicle.There are two kinds of transportations possible---one that could drop pegs at intermediate locations and pick them up later in the route for delivery (preemptive) and one that transports pegs to their targets directly (nonpreemptive). In the former case, by exploiting the freedom to drop, one may be able to find a shorter delivery route. We construct a nonpreemptive tour that is within a factor 5 of the optimal preemptive tour. In addition we show that the ratio of the distances traveled by an optimal nonpreemptive tour versus a preemptive tour is bounded by 4.