The Online Dial-a-Ride Problem under Reasonable Load
Please always quote using this URN: urn:nbn:de:0297-zib-3961
- In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp.\ average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis.
Author: | Dietrich Hauptmeier, Sven Krumke, Jörg Rambau |
---|---|
Document Type: | ZIB-Report |
Tag: | competitive analysis; elevator; online optimization |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B06 Transportation, logistics |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
CCS-Classification: | F. Theory of Computation / F.1 COMPUTATION BY ABSTRACT DEVICES / F.1.2 Modes of Computation |
Date of first Publication: | 1999/03/12 |
Series (Serial Number): | ZIB-Report (SC-99-08) |
ZIB-Reportnumber: | SC-99-08 |
Published in: | Appeared in: Proceedings of the 4th Italian Conference on Algorithms amd Complexity, Vol. 1767 of Lecture Notes in Computer Science, Springer 2000, 125-136 |