KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Thu, 28 Oct 2004 13:21:33 +0200Thu, 28 Oct 2004 13:21:33 +0200Algorithms for Time-Dependent Bicriteria Shortest Path Problems (revised version)
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1581
In this paper we generalize the classical shortest path problem in two ways. We consider two objective functions and time-dependent data. The resulting problem, called the time-dependent bicriteria shortest path problem (TdBiSP), has several interesting practical applications, but has not gained much attention in the literature.Horst W. Hamacher; Stefan Ruzika; Stevanus A. Tjandrapreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1581Thu, 28 Oct 2004 13:21:33 +0200Algorithms for Time Dependent Bicriteria Shortest Path Problems
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1450
We generalize the classical shortest path problem in two ways. We consider two - in general contradicting - objective functions and introduce a time dependency of the cost which is caused by a traversal time on each arc. The resulting problem, called time-dependent bicriteria shortest path problem (TdBiSP) has several interesting practical applications, but has not attained much attention in the literature.Horst W. Hamacher; Stevanus A. Tjandrapreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1450Wed, 12 Nov 2003 14:23:26 +0100Earliest Arrival Flows with Time-Dependent Data
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1449
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.Horst W. Hamacher; Stevanus A. Tjandrapreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1449Wed, 12 Nov 2003 12:49:13 +0100Earliest Arrival Flow with Time Dependent Capacity Approach to the Evacuation Problems
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1148
Abstract: Evacuation problems can be modeled as flow problems in dynamic networks. A dynamic network is defined by a directed graph G = (N,A) with sources, sinks and non-negative integral travel times and capacities for every arc (i,j) e A. The earliest arrival flow problem is to send a maximum amount of dynamic flow reaching the sink not only for the given time horizon T, but also for any time T' < T . This problem mimics the evacuation problem of public buildings where occupancies may not known. For the buildings where the number of occupancies is known and concentrated only in one source, the quickest flow model is used to find the minimum egress time. We propose in this paper a solution procedure for evacuation problems with a single source of the building where the occupancy number is either known or unknown. The possibility that the flow capacity may change due to the increasing of smoke density or fire obstructions can be mirrored in our model. The solution procedure looks iteratively for the shortest conditional augmenting path (SCAP) from source to sink and compute the time intervals in which flow reaches the sink via this path.Stevanus A. Tjandrapreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1148Thu, 26 Apr 2001 00:00:00 +0200