首页> 外文会议>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems >Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
【24h】

Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization

机译:Amsaa:在线随机组合优化的多步预期算法

获取原文
获取原文并翻译 | 示例

摘要

The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decisions on a variety of online stochastic combinatorial problems in dynamic fleet management, reservation systems, and more. 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 to approximate the problem; solves the resulting problem using a search algorithm for Markov decision processes from artificial intelligence; and uses a discrete optimization algorithm for guiding the search. 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.
机译:一步式预期算法(1s-AA)是一种在线算法,可以通过忽略未来的非预期约束来在不确定性下做出决策。它对动态车队管理,预订系统等中的各种在线随机组合问题做出最佳决策。在这里,我们考虑1s-AA不太接近最优的应用,并提出了Amsaa,这是一种随时可得的多步预期算法。 Amsaa结合了来自三个不同领域的技术,可以在线做出决策。它使用随机规划中的采样平均逼近方法来逼近问题。使用搜索算法从人工智能解决Markov决策过程中产生的问题;并使用离散优化算法指导搜索。 Amsaa在制药行业的一项随机项目调度应用程序上进行了评估,该应用程序具有不确定性的内生性观察。实验结果表明,在各种时间限制下,Amsaa的性能明显优于此应用程序的最新算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号