首页> 外文期刊>Computers & operations research >An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
【24h】

An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition

机译:具有序贯竞争的随机背包问题的基于Agent的随机标尺方法

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

摘要

We examine a situation in which a decision-maker executes a sequence of resource allocation decisions over time, but the availability of the indivisible resources at future epochs is uncertain due to actions of competitors. We cast this problem as a specialized type of stochastic knapsack problem in which the uncertainty of item (resource) availability is induced by competitors concurrently filling their own respective knapsacks. Utilizing a multi-period bounded multiple-choice knapsack framework, we introduce a general discrete stochastic optimization model that allows a nonlinear objective function, cardinality constraints, and a knapsack capacity constraint. Utilizing a set of greedy selection rules and agent-based modeling to simulate the competitors' actions, we solve the problem with a stochastic ruler approach that incorporates beam search to determine item selection of the types specified by the solution representation. We illustrate the computational effectiveness of our approach on instances motivated by a sports league draft as well as generic problem instances based on the knapsack literature.
机译:我们研究了决策者随时间执行一系列资源分配决策的情况,但是由于竞争者的行为,未来时期不可分割资源的可用性不确定。我们将此问题视为一种特殊类型的随机背包问题,其中项目(资源)可用性的不确定性是由竞争者同时填充各自的背包引起的。利用多周期有界选择题背包模型,我们引入了一个通用的离散随机优化模型,该模型允许非线性目标函数,基数约束和背包容量约束。利用一组贪婪的选择规则和基于代理的建模来模拟竞争对手的行为,我们使用一种随机标尺方法解决了该问题,该方法结合了波束搜索来确定解决方案表示所指定类型的项目选择。我们举例说明了我们的方法在体育联赛选秀动机以及基于背包文学的通用问题实例激励下的计算效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号