-
作者：DROR, M; POWELL, W
作者单位：Princeton University
-
作者：BALL, MO; LIN, FL
作者单位：University System of Maryland; University of Maryland College Park
摘要：This article proposes a reliability model for emergency service vehicle location. Emergency services planners must solve the strategic problem of where to locate emergency services stations and the tactical problem of the number of vehicles to place in each station, We view the problem from a system reliability perspective, where system failure is interpreted as the inability of a vehicle to respond to a demand call within an acceptable amount of time. Our model handles the stochastic problem ...
-
作者：ANILY, S; FEDERGRUEN, A
作者单位：Columbia University
摘要：We consider distribution systems with a single depot and many retailers each of which faces external demands for a single item that occurs at a specific deterministic demand rate. All stock enters the systems through the depot where it can be stored and then picked up and distributed to the retailers by a fleet of vehicles, combining deliveries into efficient routes. We extend earlier methods for obtaining low complexity lower bounds and heuristics for systems without central stock. We show un...
-
作者：DIABY, M; MARTEL, A
作者单位：Laval University
摘要：We consider the problem of determining optimal purchasing and shipping quantities over a finite planning horizon for arborescent, multi-echelon physical distribution systems with deterministic, time-varying demands. We assume that the inventory holding cost at a given warehouse of the distribution network is a linear function of the inventory level, and that the total procurement cost (i.e., ordering, plus purchasing, plus transportation and reception costs) is a general piecewise-linear funct...
-
作者：BERTSIMAS, DJ; VANRYZIN, G
作者单位：Columbia University
摘要：In 1991, D. J. Bertsimas and G. van Ryzin introduced and analyzed a model for stochastic and dynamic vehicle routing in which a single, uncapacitated vehicle traveling at a constant velocity in a Euclidean region must service demands whose time of arrival, location and on-site service are stochastic. The objective is to find a policy to service demands over an infinite horizon that minimizes the expected system time (wait plus service) of the demands. This paper extends our analysis in several...
-
作者：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....
