【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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号