arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.03550math.OC
收藏

用“概率最优性”求解一类基于离散事件仿真的最优化问题

Solving A Class of Discrete Event Simulation-based Optimization Problems Using "Optimality in Probability"

Jianfeng Mao, Christos G. Cassandras

摘要:

我们接近一类基于离散事件模拟的最优化问题使用概率的最优性,这种方法产生所谓的“冠军解决方案”。与传统的期望最优性相比,这种方法更倾向于实际性能可能优于任何其他解决方案的解决方案,这是传统最优性意义上的有效替代,特别是在面对动态和非平稳环境时。此外,对于一类基于离散事件仿真的最优化问题,使用概率中的最优性在计算上是有希望的,因为与使用期望中的最优性的一般基于仿真的最优化方法相比,它可以将计算复杂性降低几个数量级。因此,我们开发了一种“Omega Median算法”,以有效地获得冠军解决方案,并充分利用成熟的离线算法的效率,以进一步促进及时的决策。一个非平稳需求的库存控制问题,包括说明和解释使用的欧米茄中值算法,其性能进行了测试,使用模拟。

英文摘要:

We approach a class of discrete event simulation-based optimization problems using optimality in probability, an approach which yields what is termed a "champion solution". Compared to the traditional optimality in expectation, this approach favors the solution whose actual performance is more likely better than that of any other solution; this is an effective alternative to the traditional optimality sense, especially when facing a dynamic and nonstationary environment. Moreover, using optimality in probability is computationally promising for a class of discrete event simulation-based optimization problems, since it can reduce computational complexity by orders of magnitude compared to general simulation-based optimization methods using optimality in expectation. Accordingly, we have developed an "Omega Median Algorithm" in order to effectively obtain the champion solution and to fully utilize the efficiency of well-developed off-line algorithms to further facilitate timely decision making. An inventory control problem with nonstationary demand is included to illustrate and interpret the use of the Omega Median Algorithm, whose performance is tested using simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑