Over the past few years, much attention has been paid to computing flows for multi-class network equilibrium models that exhibit uniqueness of the class flows and proportionality (Bar-Gera et al., 2012). Several new algorithms have been developed such as bush based methods of Bar-Gera (2002),...

We consider a normative transshipment problem for freight flows over a multimodal network. In addition to computing the flows, which minimize a convex cost objective function, an origin/destination matrix which corresponds to the minimal cost flows must be computed as well. The supply is given...

We describe a model for the transit assignment problem with a fixed set of transit lines. The traveler chooses the strategy that allows him or her to reach his or her destination at minimum expected cost. First we consider the case in which no congestion effects occur. For the special case in...

This paper illustrates and extends our previous conceptual framework for the description of the components and interactions of transportation systems. The framework, which made use of the notions of procedure (or mapping) and steady state equilibrium, previously comprised demand, performance and...

In this paper, we extend the toll pricing framework previously developed for vehicular traffic networks to ones with the potential to include many modes of transportation such as walking, driving, and using public conveyance (e.g., buses, subways, and trains). To determine tolls, we construct a...

This article puts forward the view that, for each transportation planning or management problem, there is a particular way to simultaneously define the multiple levels of procedures useful for the problem and set it in its proper perspective, the latter essentially by the identification of what...

We consider in this paper the problem of determining intermediate origin-destination matrices for composite mode trips that involve a trip by private car to a parking facility and the continuation of the trip to the destination either by walking or by a transit mode. The intermediate...

We provide a sufficient condition for the convergence of diagonalization algorithms for equilibrium traffic assignment problems with asymmetric Jacobian matrix B(v) of the link user cost mapping s(v) of the flow v. When , where D(v*) 0 is the diagonal of B(v*) and v* is the equilibrium flow, we...