Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Stability with uniform bounds for online dial-a-ride problems under reasonable load

URN to cite this document: urn:nbn:de:bvb:703-opus-8672

Title data

Krumke, Sven O. ; Rambau, Jörg:
Stability with uniform bounds for online dial-a-ride problems under reasonable load.
Bayreuth , 2011

[img] PDF
Krumke_Rambau.pdf - Published Version
Available under License Creative Commons BY 3.0: Attribution .

Download (245kB)

Abstract

In continuously running logistic systems (like in-house pallet transportation systems), finite buffer capacities usually require controls achieving uniformly bounded waiting queues (strong stability). Standard stochastic traffic assumptions (arrival rates below service rates) can, in general, not guarantee these strong stability requirements, no matter which control. Therefore, the worst-case traffic notion of reasonable load was introduced, originally for the analysis of the Online-Dial-a-Ride Problem. A set of requests is reasonable if the requests that are presented in a sufficiently large time period can be served in a time period of at most the same length. The rationale behind this concept is that the occurrence of non-reasonable request sets renders the system overloaded, and capacity should be extended. For reasonable load, there are control policies that can guarantee uniformly bounded flow times, leading to strong stability in many cases. Control policies based on naive eoptimization, however, can in general achieve neither bounded flow times nor strong ability. In this chapter, we review the concept and examples for reasonable load. Moreover, we present new control policies achieving strong stability as well as new elementary examples of request sets where naive reoptimization fails.

Further data

Item Type: Preprint, postprint
Additional notes (visible to public): msc: 68W27; msc: 90C27; Source: Chapter 17 of "Distributed Decision Making and Control", Springer Verlag, to appear 2011.
Keywords: Dynamische Optimierung; online optimization; reasonable load; performance guarantees; online dial-a-ride
DDC Subjects: 500 Science > 510 Mathematics
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-opus-8672
Date Deposited: 25 Apr 2014 08:32
Last Modified: 28 Mar 2019 10:18
URI: https://epub.uni-bayreuth.de/id/eprint/341

Downloads

Downloads per month over past year