Operations Research · 1996 · 125 citations · 13 references
ManagementIndustrial EngineeringOperations ManagementCapacity PlanningOperations PlanningOptimizationCombinatorial OptimizationDynamic ProgrammingFleet ManagementNetwork OptimizationStochastic NetworksStochastic ProgrammingDynamic Network DesignDynamic Network FlowsFleet AllocationFleet Operations ManagementMultistage Stochastic OptimizationNetwork AllocationStochastic Dynamic OptimizationStochastic Network Optimization
We consider the class of multistage dynamic networks with random arc capacities a framework that is well suited to model dynamic fleet management problems. We propose a successive convex approximation approach that produces an approximation to the expected recourse function which captures the future effects of current decisions under uncertainty. This method decomposes the network in each stage into tree subproblems, whose expected recourse functions are easy to obtain. We also compare this method with two alternative methods on a set of dynamic fleet management problems. The numerical results show that this method is superior to the two alternative methods.
13
A survey of dynamic network flows
Jay E. Aronson · Annals of Operations Research · 1989 · 293 citations