The basic timetable based assignment problem is to find an optimal path for a pas-senger, 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 feaaibility of a path) and cost (to determine the attractiveness of a path).