-
作者：MINKOFF, AS
摘要：We describe a dynamic and stochastic vehicle dispatching problem called the delivery dispatching problem. This problem is modeled as a Markov decision process. Because exact solution of this model is impractical, we adopt a heuristic approach for handling the problem. The heuristic is based in part on a decomposition of the problem by customer, where customer subproblems generate penalty functions that are applied in a master dispatching problem. We describe how to compute bounds on the algori...
-
作者：PSARAFTIS, HN; TSITSIKLIS, JN
作者单位：Massachusetts Institute of Technology (MIT)
摘要：We examine shortest path problems in acyclic networks in which arc costs are known functions of certain environment variables at network nodes. Each of these variables evolves according to an independent Markov process. The vehicle can wait at a node (at a cost) in anticipation of more favorable arc costs. We first develop two recursive procedures for the individual arc case, one based on successive approximations, and the other on policy iteration. We also solve the same problem via parametri...
-
作者：CRAINIC, TG; GENDREAU, M; DEJAX, P
作者单位：Universite Paris Saclay; Universite de Montreal
摘要：The empty container allocation problem occurs in the context of the management of the land distribution and transportation operations of international maritime shipping companies. It involves dispatching empty containers of various types in response to requests by export customers and repositioning other containers to storage depots or ports in anticipation of future demands. We describe the problem and identify its basic structure and main characteristics. We then introduce two dynamic determ...
-
作者：BRUMELLE, SL; MCGILL, JI
作者单位：Queens University - Canada
摘要：This paper addresses the problem of determining optimal booking policies for multiple fare classes that share the same seating pool on one leg of an airline flight when seats are booked in a nested fashion and when lower fare classes book before higher ones. We show that a fixed-limit booking policy that maximizes expected revenue can be characterized by a simple set of conditions on the subdifferential of the expected revenue function. These conditions are appropriate for either the discrete ...
-
作者：TERRAB, M; ODONI, AR
作者单位：Massachusetts Institute of Technology (MIT)
摘要：One of the most important functions of air traffic management systems is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the ATC system should be postponed to reduce the likelihood and extent of airborne delays. In this paper, we will present an analysis of the fundamental case in which flights from many origins must be scheduled for arrival at a single, congested airport....
-
作者：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...
