• Deutsch
Login

OPUS

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
Search Fields

Refine

Author

  • Jörg Rambau (2)
  • Cornelius Schwarz (1)
  • Sven O. Krumke (1)

Year of publication

  • 2007 (1)
  • 2011 (1)

Language

  • German (1)
  • English (1)

Keywords

  • online optimization (2) (remove)

2 search hits

search hits 1 to 2

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Show/Hide Abstract Zwei auf einen Streich: Optimierte dynamische Einsatzplanung für Gelbe Engel und Lastenaufzüge (2007)
Jörg Rambau Cornelius Schwarz
Wir modellieren zwei verschiedene dynamische Einsatzplanungsprobleme: die dynamische Einsatzplanung Gelber Engel beim ADAC und die Steuerung von Lastenaufzügen in einem Versandlager der Herlitz PBS AG. Wir benutzen eine Reoptimierungspolitik, die die Steuerung des Systems mit Hilfe der Lösung von statischen Schnappschussproblemen durchführt. Für die auftretenden Schnappschussprobleme vergleichen wir zwei Modellierungsansätze (Flussmodell versus Tourenmodell), von denen nur einer echtzeittauglich ist. Das Verfahren zur dynamischen Einsatzplanung Gelber Engel ist beim ADAC in Betrieb.
Show/Hide Abstract Stability with uniform bounds for online dial-a-ride problems under reasonable load (2011)
Sven O. Krumke Jörg Rambau
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.

search hits 1 to 2

OPUS4 Logo

  • Contact
  • Imprint
  • Sitelinks