Deterministic Time Table Transit Assignment
The basic timetable based assignment problem is to find an optimal path for a passenger, given an origin node, a destination node, and departure or arrival time information. The deterministic transit assignment does not necessarily minimize the total elapsed travel time, but rather uses weight factors and non-time-based cost elements in determining the optimal path. Therefore, the algorithm tracks both time (to determine the feasibility of a path) and cost (to determine the attractiveness of a path).
KeywordsOptimal Path Penalty Factor Target Time Transit Line Allowed Time
Unable to display preview. Download preview PDF.
- INRO Consultants (1998), EMME/2 User’s Manual, Release 9.Google Scholar