Semi-preemptive routing on a line
Semi-preemptive routing on a line.
Published in: Electronic Notes in Discrete Mathematics Vol. 17. pp. 241-246.
The problem of routing a robot (or vehicle) between n stations in the plane in order to transport objects is well studied, even if the stations are specially arranged, e.g. on a linear track or circle. The robot may use either all or none of the stations for reloading. We will generalize these concepts of preemptiveness/non--preemptiveness and emancipate the robot by letting it choose k<=n reload--stations.
|Citations:||2 (Google Scholar) ||
|Uncontrolled Keywords:||pickup and delivery dial-a-ride routing route planning combinatorial optimization|
|Divisions:||Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
Mathematical Institute > Prof. Dr. Faigle
|Depositing User:||Dirk Räbiger|
|Date Deposited:||25 Nov 2004 00:00|
|Last Modified:||19 Dec 2011 09:44|