J Org Rambau, Dietrich Hauptmeier, Sven O. Krumke
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...
The Online Dial-a-Ride Problem under Reasonable Load (2000)
Dietrich Hauptmeier, Sven O. Krumke
. In this paper, we analyze algorithms for the online dial-aride problem with request sets that fulll a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride...
Euler is Standing in Line - Dial-a-Ride Problems with FIFO-Precedence-Constraints (1970)
Dietrich Hauptmeier, Krumke Rambau, Hans-christoph Wirth, D. Hauptmeier, S. O. Krumke, J. Rambau
. In this paper we study algorithms for "Dial-a-Ride" transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to...
Simulation Studies for the Online Dial-a-Ride Problem (1970)
Martin Otschel, Krumke Rambau, Martin Gr Otschel, Dietrich Hauptmeier, Sven O. Krumke
. In a large distribution center of Herlitz AG, Berlin, we investigated the elevator subsystem of the fully automated pallet transportation system. Each elevator may carry one pallet and has to serve...
The Online Dial-a-Ride Problem under Reasonable Load (1970)
Dietrich Hauptmeier, Sven O. Krumke
. 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...