Developing conflict-free routes for automated guided vehicles
Operations Research
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Shunting of Passenger Train Units in a Railway Station
Transportation Science
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We consider a natural basic model for conflict-free routing of a group of k vehicles, a problem frequently encountered in many applications in transportation and logistics. There is a large gap between currently employed routing schemes and the theoretical understanding of the problem. Previous approaches have either essentially no theoretical guarantees, or suffer from high running times, severely limiting their usability. So far, no efficient algorithm is known with a sub-linear (in k) approximation guarantee and without restrictions on the graph topology. We show that the conflict-free vehicle routing problem is hard to solve to optimality, even on paths. Building on a sequential routing scheme, we present an algorithm for trees with makespan bounded by O(OPT) + k. Combining this result with ideas known from packet routing, we obtain a first efficient algorithm with sub-linear approximation guarantee, namely an O(√k)-approximation. Additionally, a randomized algorithm leading to a makespan of O(polylog(k)) ċ OPT+k is presented that relies on tree embedding techniques applied to a compacted version of the graph to obtain an approximation guarantee independent of the graph size.