Deterministic Time Table Transit Assignment
Abstract: 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 minim_
ize 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 attract_ive_
ness of a path).

Presented by Michael Florian First Asian EMME/2 Users Group Meeting August 23-24, 1999 Shanghai, P.R. China

Acknowledgments: This development was carried out by Heinz Spiess. The text is based on sections of the EMME/2 Users Manual, Release 9, which was written by Isabelle Constantin, Linda James-Lefebvre and Gabriela Simonka.
確定性的時間表轉(zhuǎn)接分配
摘要： 以基本的時間表為基礎(chǔ)的分配問題是為了一個旅客找到一條最理想的路徑，給一個起源站點，一個目的地站點，和離開或者到達時間信息。 確定性的轉(zhuǎn)接分配不一定最大限度地減少整個的流逝的行駛時間，但是相當(dāng)在確定最理想的路徑時使用權(quán)值因素和以時間為基礎(chǔ)的費用元素。 因此，算法需要考慮時間(確定一條路徑的可行性)和耗費(確定一條路徑所具有吸引力)。
Michael Florian 講
1999年八月23-24日中國上海第一屆亞洲EMME/2用戶組會議
通告：這發(fā)展被Heinz Spiess實行。 正文基于Isabelle Constantin，Linda詹姆斯Lefebvre和Gabriela Simonka寫的EMME/2用戶手冊，第9版。
確定性的轉(zhuǎn)接分配
1一般的問題定義