Dual-Directed Algorithm Design for Efficient Pure Exploration
C Qin, W You - arXiv preprint arXiv:2310.19319, 2023 - arxiv.org
We consider pure-exploration problems in the context of stochastic sequential adaptive
experiments with a finite set of alternative options. The goal of the decision-maker is to …
experiments with a finite set of alternative options. The goal of the decision-maker is to …
Simulation Budget Allocation for Improving Scheduling and Routing of Automated Guided Vehicles in Warehouse Management
Simulation budget allocation is a widely used technique for evaluating and optimizing
dynamic discrete event stochastic system via efficient sampling. In warehouse management …
dynamic discrete event stochastic system via efficient sampling. In warehouse management …
Top-Two Thompson Sampling for Contextual Top-mc Selection Problems
We aim to efficiently allocate a fixed simulation budget to identify the top-mc designs for
each context among a finite number of contexts. The performance of each design under a …
each context among a finite number of contexts. The performance of each design under a …
An Efficient Node Selection Policy for Monte Carlo Tree Search with Neural Networks
Monte Carlo tree search (MCTS) has been gaining increasing popularity, and the success of
AlphaGo has prompted a new trend of incorporating a value network and a policy network …
AlphaGo has prompted a new trend of incorporating a value network and a policy network …
A Simulation Optimization Method for Scheduling Automated Guided Vehicles in a Stochastic Warehouse Management System
We consider the problem of scheduling automated guided vehicles (AGVs) in a stochastic
warehouse management system. This problem was studied in the Case Study Competition …
warehouse management system. This problem was studied in the Case Study Competition …