An algorithm for multistage dynamic networks with random arc capacities, with an application for dynamic fleet management

An algorithm for multistage dynamic networks with random arc capacities, with an application for dynamic fleet management

0.00 Avg rating0 Votes
Article ID: iaor20003498
Country: United States
Volume: 44
Issue: 6
Start Page Number: 951
End Page Number: 963
Publication Date: Nov 1996
Journal: Operations Research
Authors: ,
Keywords: networks
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.