-
作者：BERGE, ME; HOPPERSTAD, CA
摘要：A major problem for the airline industry is the assignment of airplane capacity to flight schedules to meet fluctuating market needs. Demand Driven Dispatch (D3) is an operating concept that addresses this problem. Utilizing a demand forecast which improves as flight departure approaches, aircraft are dynamically assigned to flights to better match the predicted final demands. The result, demonstrated in studies of actual airline systems, is an increase in passenger loads and revenues with sim...
-
作者：DAVIS, GA; NIHAN, NL
作者单位：University of Washington; University of Washington Seattle
摘要：Recent interest in stochastic traffic assignment models has been motivated by a need to determine the stationary probability distribution of a network's traffic volumes and by the possibility of using time-series of traffic counts to fit and test travel demand models. Because of the way traffic volumes are generated as the sum of path flows from different origin-destination pairs, and because of the nonlinear nature of the process relating traffic conditions to traveler route selection, most p...
-
作者：FRIESZ, TL; BERNSTEIN, D; SMITH, TE; TOBIN, RL; WIE, BW
作者单位：Massachusetts Institute of Technology (MIT); University of Pennsylvania; University of Hawaii System
摘要：In the present paper we are concerned with developing more realistic dynamic models of route choice and departure time decisions of transportation network users than have been proposed in the literature heretofore. We briefly review one class of models that is a dynamic generalization of the static Wardropian user equilibrium, the so-called Boston traffic equilibrium. In contrast, we then propose a new class of models that is also a dynamic generalization of the static Wardropian user equilibr...
-
作者：RAN, B; BOYCE, DE; LEBLANC, LJ
作者单位：Vanderbilt University
摘要：The instantaneous dynamic user-optimal (DUO) traffic assignment problem is to determine vehicle flows on each link at each instant of time resulting from drivers using instantaneous minimal-time routes. Instantaneous route time is the travel time incurred if traffic conditions remain unchanged while driving along the route. In this paper, we introduce a different definition of an instantaneous DUO state. Using the optimal control theory approach, we formulate two new DUO traffic assignment mod...
-
作者：BIRGE, JR; HO, JK
作者单位：University of Illinois System; University of Illinois Chicago; University of Illinois Chicago Hospital
摘要：This paper presents a method for finding optimal flows in a dynamic network with random inputs into the system and congestion limits on flow. This model has been used in deterministic settings to represent dynamic traffic assignment and job shop routing. This paper builds on the deterministic results to show that a globally optimal solution in the stochastic problem may be obtained by a sequence of linear optimizations. A decomposition algorithm for this procedure is presented that efficiently...
-
作者：CAREY, M; SRINIVASAN, A
作者单位：Purdue University System; Purdue University
摘要：For congested networks on which flows vary over time, we derive system marginal costs, user perceived costs and user externality costs, for each arc and path. We also obtain a set of optimal congestion tolls and flow controls which may be used to shift the user determined flows toward a socially preferred pattern. An important way in which our results differ from the usual static analysis is that the social cost externality depends not only on the level of congestion, but also on the rate of i...
