An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization

An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization

0.00 Avg rating0 Votes
Article ID: iaor20112605
Volume: 184
Issue: 1
Start Page Number: 233
End Page Number: 271
Publication Date: Apr 2011
Journal: Annals of Operations Research
Authors: ,
Keywords: programming: markov decision, artificial intelligence: decision support, programming: probabilistic
Abstract:

The one‐step anticipatory algorithms (1s‐AA) is an online algorithm making decisions under uncertainty by ignoring the non‐anticipativity constraints in the future. It was shown to make near‐optimal decisions on a variety of online stochastic combinatorial problems in dynamic fleet management and reservation systems. Here we consider applications in which 1s‐AA is not as close to the optimum and propose Amsaa, an anytime multi‐step anticipatory algorithm. Amsaa combines techniques from three different fields to make decisions online. It uses the sampling average approximation method from stochastic programming, search algorithms for Markov decision processes from artificial intelligence, and discrete optimization algorithms. Amsaa was evaluated on a stochastic project scheduling application from the pharmaceutical industry featuring endogenous observations of the uncertainty. The experimental results show that Amsaa significantly outperforms state‐of‐the‐art algorithms on this application under various time constraints.

Reviews

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