Label setting techniques are all based on Dijkstra's condition of always scanning the node with the minimum label, which guarantees that each node will be scanned exactly once; while this condition is sufficient it is not necessary. In this paper, we discuss less restrictive conditions that allow...

Most shortest path algorithms do not explicitly consider intersection movements in calculating best paths. However, in congested street networks, turning movement delays can be significant, and ignoring them may lead to the calculation of suboptimal or illogical paths. To reflect turning...

This paper is concerned with the stochastic shortest path problem with recourse when limited forms of spatial and temporal arc cost dependencies are accounted for. Recourse is defined as the opportunity for a decision-maker to re-evaluate his or her remaining path when en route information is...

<title>A<sc>bstract</sc> </title> In this paper, we present a dynamic traffic assignment-simulation modeling framework (DYNASMART-P) to support the evaluation and planning of Bus Rapid Transit (BRT) services in urban transportation networks. The model represents the different characteristics associated with BRT...

A continuum model that describes a disordered, heterogeneous traffic stream is presented. Such systems are widely prevalent in developing countries where classical traffic models cannot be readily applied. The characteristics of such systems are unique since drivers of smaller vehicles exploit...