Surrogate Assisted Monte Carlo Tree Search in Combinatorial Optimization

Saeid Amiri, Parisa Zehtabi, Danial Dervovic, Michael Cashmore
3/14/2024
cs.AI

No confident code implementation found for this paper.

Abstract

Industries frequently adjust their facilities network by opening new branches in promising areas and closing branches in areas where they expect low profits. In this paper, we examine a particular class of facility location problems. Our objective is to minimize the loss of sales resulting from the removal of several retail stores. However, estimating sales accurately is expensive and time-consuming. To overcome this challenge, we leverage Monte Carlo Tree Search (MCTS) assisted by a surrogate model that computes evaluations faster. Results suggest that MCTS supported by a fast surrogate function can generate solutions faster while maintaining a consistent solution compared to MCTS that does not benefit from the surrogate function.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{amiri2024surrogate,
  title  = {Surrogate Assisted Monte Carlo Tree Search in Combinatorial Optimization},
  author = {Saeid Amiri and Parisa Zehtabi and Danial Dervovic and Michael Cashmore},
  year   = {2024},
  eprint = {2403.09925},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.09925v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.09925.svg)](https://codeofpaper.com/paper/2403.09925)

Discussion