Earliest Arrival Flows with Time-Dependent Data
- In this paper we discuss an earliest arrival flow problem of a network having arc travel times and capacities that vary with time over a finite time horizon T. We also consider the possibility to wait (or park) at a node before departingon outgoing arc. This waiting is bounded by the value of maximum waiting time and the node capacity which also vary with time.
Author: | Horst W. Hamacher, Stevanus A. Tjandra |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-12705 |
Series (Serial Number): | Report in Wirtschaftsmathematik (WIMA Report) (88) |
Document Type: | Preprint |
Language of publication: | English |
Year of Completion: | 2003 |
Year of first Publication: | 2003 |
Publishing Institution: | Technische Universität Kaiserslautern |
Date of the Publication (Server): | 2003/11/12 |
GND Keyword: | Network flows; Earliest arrival augmenting path; Dynamic cut |
Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |