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

Raymond K. Cheung, Warren Buckler Powell

Research output: Contribution to journalArticle

79 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)951-963
Number of pages13
JournalOperations Research
Volume44
Issue number6
DOIs
StatePublished - Jan 1 1996

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'AN algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management'. Together they form a unique fingerprint.

  • Cite this