With the same level of information, however, constant headways, the strategy of a passenger is in principle the same. From an optimal line set L* = Li* he or she selects the line which arrives first. The determination of i* now follows the following different approach.
You can recalculate that it is insufficient in this case, to regard the result (L1, L2, ..., Ln) of potentially optimal line sets and to cancel exactly at that point when for the first time the following applies: ECLi > ECLi-1. This is caused by the fact, that there can be more than one local minimum in the sequence (Li). Therefore 
guarantees, that the optimal line set is composed exactly from those lines, which reduce the expected remaining costs if being included in the selection.
The shares assigned to the individual lines again correspond with the possibility of arriving first.
is the minimal occurring headway. This results in the following expected wait time.
If the timetable in the analyzed network is regular and only slightly irregular, and the passengers do not have any information on departure times, this choice model is more realistic than the model considered before.
