Corrigendum to “Least Expected Time Paths in Stochastic Schedule-Based Transit Networks”

The article titled “Least Expected Time Paths in Stochastic Schedule-Based Transit Networks” [1] reports similar methods and algorithms to those in an earlier article by Miller-Hooks and Mahmassani [2] which was not cited. The article by Vo et al. deals with stochastic scenario-based arrival times of transit vehicles while Miller-Hooks and Mahmassani’s article focuses on stochastic road networks where link travel times are not correlated. Thus, the dominance condition used in Vo et al.’s algorithm is based on scenarios in which the departure time is fixed and given. In contrast, the dominance condition used in Miller-Hooks and Mahmassani’s algorithm is with respect to all departure times.