Urban and Regional Transportation Modeling: Essays in Honor of David BoyceDer-Horng Lee, David E. Boyce Honoring David Boyce for his legendary contributions to the fields of transportation modeling and regional science, the chapters in this festschrift highlight and analyze state-of-the-art and state-of-the-practice methodologies and theories in transportat |
Contents
| 1 | |
2 A combined distribution hierarchical mode choice and assignment network model with multiple user and mode classes | 25 |
formulations and algorithms | 43 |
4 Iterationfree microassignment | 58 |
5 Cost minimizing behavior in random discrete choice modeling | 70 |
6 A modified iterative scheme for the equilibrium traffic signal setting problem | 83 |
7 Transport and location effects of a ring road in a city with or without road pricing | 113 |
8 Optimal integrated pricing in a bimodal transportation network | 134 |
12 System performance in network with parking andor route information systems | 232 |
13 Realtime spatiotemporal data mining for shortterm traffic forecasting | 252 |
14 Online traffic assignment and network loading | 260 |
15 Multimodal routing and navigation cost functions for locationbased services LBS | 278 |
16 Supply chain supernetworks with random demands | 289 |
17 An efficient pathbased algorithm for a dynamic user equilibrium problem | 314 |
18 Numerical experiments with a decision support methodology for strategic traffic management | 337 |
infrastructure in Brazil towards an integrated approach | 365 |
9 Planning transport network improvements over time | 157 |
10 Estimating link delays for arterial streets | 177 |
11 Modeling travel times along signalized streets using expected cumulative counts | 210 |
20 Accessibility and site rents in the Ceconomy | 380 |
Index | 391 |
Other editions - View all
Common terms and phrases
analysis Anna Nagurney approach assumed ATIS ATIS service auto average backpropagation neural network Boyce capacity cent CNDP CNDP-T computational congestion pricing constraints consumer surplus convergence cost minimizing behavior decision makers destination discrete choice distributors drivers dynamic economic equation estimated ETSS example forecasting formulation function highway iterations linear link flows link travel market penetration method microsimulation modal split mode choice mode class Nagurney neural network node O-D flow O-D pair optimal parameter parking delay pattern prediction probability distribution procedure public transport random regions retailers ring road road network road pricing route choice route travel scenario segment signal control signal settings simulation solving Step stochastic subproblem tion traffic assignment transit fare Transport Economics transportation network Transportation Research travel demand travel time adjustments trip distribution urban user equilibrium values variables variational inequality vector zone ΣΣ
Popular passages
Page 41 - The work described in this paper was partially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No.
Page 306 - The algorithm is guaranteed to converge provided that the function F that enters the variational inequality is monotone and Lipschitz continuous (and that a solution exists). The algorithm is the modified projection method of Korpelevich (1977).
Page 292 - The manufacturers are assumed to compete in a non-cooperative fashion. Also, it is assumed that the production cost functions and the transaction cost functions for each manufacturer are continuous and convex. The governing optimization/equilibrium concept underlying non-cooperative behavior is that of Nash (1950, 1951), which states, in this context, that each manufacturer will determine his optimal production quantity and shipments, given the optimal ones of the competitors. Hence, the optimality...
Page 304 - Theorem 6 it follows that, under the above conditions, the equilibrium product shipment pattern between the manufacturers and the retailers, as well as the equilibrium price pattern at the retailers, is unique. Theorem 7: Lipschitz Continuity The function F that enters the variational inequality problem (30) is Lipschitz continuous, that is, \\F(X') - F(X")\\ < L\\X' - X"\\, VX', X" & K, with L > 0, (55) under the following conditions: (i).
Page 306 - Proof. According to Korpelevich (1977), the modified projection method converges to the solution of the variational inequality problem of the form...
Page 296 - ... which represents the non-negativity assumption on the variables. Here, we also assume that the retailers compete in a non-cooperative manner so that each maximizes his profits, given the actions of the other retailers. Note that, at this point, we consider that retailers seek to determine the amount that they wish to obtain from the manufacturers and from the distributors.
Page 301 - In order to prove that g(s, p) is monotone with respect to 5 and p, we only need to show that its Jacobian matrix is positive semidefinite, which will be the case if all eigenvalues of the symmetric part of the Jacobian matrix are nonnegative real numbers.
Page 132 - Modelling Land-Use and Transport Interaction: Policy Analyses Using the IMREL Model ', in L. Lundqvist. LG. Mattsson and TJ Kim (eds), Network Infrastructure and the Urban Environment, Springer- Verlag.
References to this book
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction ... Hani S. Mahmassani No preview available - 2005 |