https://opus4.kobv.de/opus4-zibOPUS documents
https://opus4.kobv.de/opus4-zib/index/index/
Tue, 19 Dec 2000 00:00:00 +0100Tue, 19 Dec 2000 00:00:00 +0100An Approximation Algorithm for the Non-Preemptive Capacitated Dial-a-Ride Problem
https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/621
In the Capacitated Dial-a-Ride Problem (CDARP) we are given a transportation network and a finite set of transportation jobs. Each job specifies the source and target location which are both part of the network. A server which can carry at most $C$~objects at a time can move on the transportation network in order to process the transportation requests. The problem CDARP consists of finding a shortest transportation for the jobs starting and ending at a designated start location. In this paper we are concerned with the restriction of CDARP to graphs which are simple paths. This setting arises for instance when modelling applications in elevator transportation systems. It is known that even for this restricted class of graphs CDARP is NP-hard to solve. We provide a polynomial time approximation algorithm that finds a transportion of length at most thrice the length of the optimal transportation.Sven O. Krumke; Jörg Rambau; Steffen Weiderreportzibhttps://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/621Tue, 19 Dec 2000 00:00:00 +0100Euler is Standing in Line
https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/394
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 find a shortest transportation that serves all the jobs. This problem is known to be NP-hard even on trees. We consider the extension when precedence relations between the jobs with the same source are given. Our results include a polynomial time algorithm on paths and an approximation algorithm on general graphs with a performance of~$9/4$. For trees we improve the performance to~$5/3$.Dietrich Hauptmeier; Sven O. Krumke; Jörg Rambau; Hans-Christoph Wirth.reportzibhttps://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/394Wed, 03 Mar 1999 00:00:00 +0100