A demand model with departure time choice for within-day dynamic traffic assignment

A within-clay dynamic demand model is formulated, embodying, in addition to the classic generation, distribution and modal split stages, an actual demand model taking into account departure time choice. The work focuses on this last stage, represented through an extension of the discrete choice framework to a continuous choice set. The dynamic multimodal supply and equilibrium model based on implicit path enumeration, which have been developed in previous work are outlined here, to define within-day dynamic elastic demand stochastic multimodal equilibrium as a fixed point problem on users flows and transit line frequencies. A MSA algorithm capable, in the case of Logit route choice models, of supplying equilibrium flows and frequencies on real dimension networks, is presented, as well as the specific procedures implementing the departure time choice and actual demand models. Finally, the results obtained on a test network are presented and conclusions are drawn. (c) 2005 Elsevier B.V. All rights reserved

Application of Market Models to Network Equilibrium Problems

We present a general two-side market model with divisible commodities and price functions of participants. A general existence result on unbounded sets is obtained from its variational inequality re-formulation. We describe an extension of the network flow equilibrium problem with elastic demands and a new equilibrium type model for resource allocation problems in wireless communication networks, which appear to be particular cases of the general market model. This enables us to obtain new existence results for these models as some adjustments of that for the market model. Under certain additional conditions the general market model can be reduced to a decomposable optimization problem where the goal function is the sum of two functions and one of them is convex separable, whereas the feasible set is the corresponding Cartesian product. We discuss some versions of the partial linearization method, which can be applied to these network equilibrium problems.Comment: 18 pages, 3 table

Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user classes

This paper presents a formulation of the multiple user class, variable demand, probit stochastic user equilibrium model. Sufficient conditions are stated for differentiability of the equilibrium flows of this model. This justifies the derivation of sensitivity expressions for the equilibrium flows, which are presented in a format that can be implemented in commercially available software. A numerical example verifies the sensitivity expressions, and that this formulation is applicable to large networks

Advanced pricing and rationing policies for large scale multimodal networks

The applying of simplified schemes, such as cordon pricing, as second-best solution to the toll network design problem is investigated here in the context of multiclass traffic assignment on multimodal networks. To this end a suitable equilibrium model has been developed, together with an efficient algorithm capable of simulating large scale networks in quite reasonable computer time. This model implements the theoretical framework proposed in a previous work on the toll optimization problem, where the validity of marginal cost pricing for the context at hand is stated. Application of the model to the real case of Rome shows us, not only that on multimodal networks a relevant share (up to 20%) of the maximum improvements in terms of social welfare achievable with marginal cost pricing can in fact be obtained through cordon pricing, but also that in practical terms rationing is a valid alternative to pricing, thus getting around some of the relevant questions (theoretical, technical, social) the latter raises. As a result we propose a practical method to analyze advanced pricing and rationing policies differentiated for user categories, which enables us to compare alternative operative solutions with an upper bound on social welfare based on a solid theoretical background. (c) 2005 Elsevier Ltd. All rights reserved

Benefit-Cost Analysis for Transportation Planning and Public Policy: Towards Multimodal Demand Modeling

This report examines existing methods of benefit-cost analysis (BCA) in two areas, transportation policy and transportation planning, and suggests ways of modifying these methods to account for travel within a multimodal system. Although the planning and policy contexts differ substantially, this report shows how important multimodal impacts can be incorporated into both by using basic econometric techniques and even simpler rule-of-thumb methods. Case studies in transportation planning focus on the California Department of Transportation (Caltrans), but benchmark California’s competencies by exploring methods used by other states and local governments. The report concludes with a list and discussion of recommendations for improving transportation planning models and methods. These will have immediate use to decision makers at Caltrans and other state DOTs as they consider directions for developing new planning capabilities. This project also identifies areas, and lays groundwork, for future research. Finally, by fitting the planning models into the broader context of transportation policy, this report will serve as a resource for students and others who wish to better understand BCA and its use in practice

A Multi-modal Trip Distribution Model

This paper presents a multimodal trip distribution function estimated and validated for the metropolitan Washington region. In addition, a methodology for measuring accessibility, which is used as a measure of effectiveness for networks, using the impedance curves in the distribution model is described. This methodology is applied at the strategic planning level to alternative HOV alignments to select alignments for further study and Right-of-Way preservation. .

The Green Choice: Learning and Influencing Human Decisions on Shared Roads

Autonomous vehicles have the potential to increase the capacity of roads via platooning, even when human drivers and autonomous vehicles share roads. However, when users of a road network choose their routes selfishly, the resulting traffic configuration may be very inefficient. Because of this, we consider how to influence human decisions so as to decrease congestion on these roads. We consider a network of parallel roads with two modes of transportation: (i) human drivers who will choose the quickest route available to them, and (ii) ride hailing service which provides an array of autonomous vehicle ride options, each with different prices, to users. In this work, we seek to design these prices so that when autonomous service users choose from these options and human drivers selfishly choose their resulting routes, road usage is maximized and transit delay is minimized. To do so, we formalize a model of how autonomous service users make choices between routes with different price/delay values. Developing a preference-based algorithm to learn the preferences of the users, and using a vehicle flow model related to the Fundamental Diagram of Traffic, we formulate a planning optimization to maximize a social objective and demonstrate the benefit of the proposed routing and learning scheme.Comment: Submitted to CDC 201

Parallel computation of large-scale network equilibria and variational inequalities.

Equilibrium of a network is obtained when each user who competes to optimize his utility can not improve his utility any further. Equilibrium problems governed by distinct equilibrium concepts can be formulated in one general framework--that of variational inequalities. The synthesis of variational inequalities and networks induces the creation of highly efficient algorithms which are especially suited for the large-scale equilibrium problems. Motivated by the recent technological advances in parallel computing architectures, parallel algorithms of large-scale equilibrium problems were developed using the theory of variational inequalities. In the case where the feasible constraint set of a network equilibrium problem can be expressed as a Cartesian product of subsets, the application of variational inequality decomposition algorithms for the parallel computation becomes possible. A new spatial price equilibrium model, which is not based on the path flows, but, rather, on the link flows to allow the decomposition by time periods, was developed and used as a prototype of large-scale network equilibrium problems. The variational inequality formulations were decomposed first by commodities, then by time periods, and, subsequently, by markets. The coarse grain parallel architectures used were the IBM 3090-600E and the IBM 3090-600J at the Cornell Theory Center with six processors each. The maximum speed-ups obtained were 1.93 for two processors, 3.74 for four processors, and 5.15 for six processors. The market subproblems were further decomposed by links, resulting in a fine grain parallel implementation. The Thinking Machine\u27s Connection Machine, CM-2, with 32,768 processors was used for the numerical experimentation. The fine grain parallel algorithm solved input/output matrix problems more than 20 times faster, when compared to the results on the IBM 3090-600J. It is expected that further enhancements to parallel languages and parallel architectures will make even more efficient implementations realizable, and that parallel computing and the theory of variational inequalities can be successfully applied to solve more efficiently other large-scale problems with an underlying network structure, such as traffic equilibrium problems, general economic equilibrium problems, and financial equilibrium problems