Filtern
Dokumenttyp
- Preprint (3) (entfernen)
Schlagworte
- Dynamic cut (1)
- Earliest arrival augmenting path (1)
- Label correcting algorithm (1)
- Label setting algorithm (1)
- Multiple criteria analysis (1)
- Multiple criteria optimization (1)
- Network flows (1)
- bicriteria shortest path problem (1)
- label setting algorithm (1)
- time-dependent shortest path problem (1)
-
Algorithms for Time-Dependent Bicriteria Shortest Path Problems (revised version)
(2004)
- 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.
-
Algorithms for Time Dependent Bicriteria Shortest Path Problems
(2003)
- 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.
-
Earliest Arrival Flows with Time-Dependent Data
(2003)
- 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.
