## On-Line Algorithms for the Dynamic Traveling Repair Problem (2002)

Citations: | 10 - 0 self |

### BibTeX

@MISC{Irani02on-linealgorithms,

author = {Sandy Irani and et al.},

title = {On-Line Algorithms for the Dynamic Traveling Repair Problem},

year = {2002}

}

### OpenURL

### Abstract

### Citations

138 |
Competitive algorithms for server problems
- Manasse, McGeoch, et al.
- 1990
(Show Context)
Citation Context ...cident node[5]. In our problem, the entire graph (or metric space) is known in advance and the locations of requests are revealed on an on-line manner. Another related problem is the k-server problem =-=[7]-=-. In the k-server problem, it is assumed that servers can travel instantaneously to their destination, although the goal is to minimize the total distance traveled by all servers. Also, in the k-serve... |

105 |
Exploring an unknown graph
- Deng, Papadimitriou
- 1990
(Show Context)
Citation Context ...t. Other related work includes online graph exploration problems in which all nodes of a graph must be visited and the edges of the graph are revealed only when the server has visited an incident node=-=[5]-=-. In our problem, the entire graph (or metric space) is known in advance and the locations of requests are revealed on an on-line manner. Another related problem is the k-server problem [7]. In the k-... |

82 |
Stochastic and dynamic networks and routing
- Powell, Jaillet, et al.
- 1995
(Show Context)
Citation Context ... location problem and other problems such asthe probabilistic shortest path problem and the dynamic vehicle allocation problem. Powell, Jaillet and Odoni provide an excellent review of these problems =-=[8]-=-. In the DTSP, customer locations are known in advance and service requests arrive according to a Poisson point process at each node. The objective is to determine a dispatching strategy which minimiz... |

67 | Ryzin, “A stochastic and dynamic vehicle routing problem in the Euclidean plane - Bertsimas, van - 1991 |

53 | New Approximation Guarantees for Minimum-Weight k-Tress and Prize-Collecting Salesmen
- Awebuch, Azar, et al.
(Show Context)
Citation Context ...rval and expire in the following interval. The algorithm mustssolve an instance of the prize-collecting TSP problem with a xed starting position and arbitrary ending location for every interval. (See =-=[1]-=- for a discussion of the prize-collecting TSP). BATCH requires that the noti cation deadline ( ) be at least 1=2. We prove that BATCH is (3=(1 ; 2 ))-competitive. We also give a lower bound for BATCH ... |

45 |
Ryzin. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles
- Bertsimas, van
- 1993
(Show Context)
Citation Context ...ch learn about a new request only when it arrives into the system. The DTRP has many practical applications. Examples include routing utility and other repair eets as well as routing of tanker trucks =-=[3, 4]-=-. In this paper, we consider the following restrictions to the DTRP problem: Single Server: We address the problem where there is only one server. Information and Computer Science, UC Irvine, 92697, i... |

43 | A priori solution of a traveling salesman problem in which a random subset of the customers are visited - Jaillet - 1988 |

33 | Online dial-a-ride problems: Minimizing the completion time - Ascheuer, Krumke, et al. - 2000 |

24 | Algorithms for the on-line travelling salesman
- Ausiello, Feuerstein, et al.
(Show Context)
Citation Context ...our results hold if there is a small, xed service time except forsTheorem 6.1 which requires the fact that the service time is zero. Aword about metric spaces: some previous work on related problems (=-=[2]-=-) focus on continuous metric spaces in which the path between anytwo points is continuous, formed by points in the metric space. In particular, this implies that the server can do a U-turn at any poin... |

24 | New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen - Awerbuch, Azar, et al. - 1999 |

23 | The k-client Problem - Alborzi, Torng, et al. |

21 | On-line single-server dial-a-ride problems - Feuerstein, Stougie - 2001 |

20 | The online dial-a-ride problem under reasonable load - Hauptmeier, Krumke, et al. - 2000 |

17 | Erratum to “news from the online traveling repairman - Krumke, Paepe, et al. |

16 |
Ryzin, ”A Stochastic and Dynamic Vehicle Routing
- Bertsimas, Van
- 1991
(Show Context)
Citation Context ...ch learn about a new request only when it arrives into the system. The DTRP has many practical applications. Examples include routing utility and other repair eets as well as routing of tanker trucks =-=[3, 4]-=-. In this paper, we consider the following restrictions to the DTRP problem: Single Server: We address the problem where there is only one server. Information and Computer Science, UC Irvine, 92697, i... |

4 |
A priori Solution of a Traveling Salesman
- JAILLET
- 1988
(Show Context)
Citation Context ...omers' expected waiting time. This problem is discussed by Psara ts [9]. In the PTSP, an a priori tour must be constructed for anetwork in which each node has a given probability of requiring a visit =-=[6]-=-. The DTRP is also usually considered under the assumption that the input is generated by a known probability distribution. In this paper, we analyze algorithms for the DTRP using competitive analysis... |

3 | Linear Time Approximation Schemes for Vehicle Scheduling - Augustine, Seiden - 2002 |

3 | Euler is standing in line dial-a-ride problems with FIFO precedence constraints - Hauptmeier, Krumke, et al. - 2001 |

1 |
ts. Dynamic Vehicle Routing Problems. Vehicle Routing: Methods and
- Psara
- 1988
(Show Context)
Citation Context ... arrive according to a Poisson point process at each node. The objective is to determine a dispatching strategy which minimizes customers' expected waiting time. This problem is discussed by Psara ts =-=[9]-=-. In the PTSP, an a priori tour must be constructed for anetwork in which each node has a given probability of requiring a visit [6]. The DTRP is also usually considered under the assumption that the ... |

1 | Dynamic Vehicle Routing Problems. Vehicle Routing: Methods and Studies - Psarafits - 1988 |