2000 character limit reached
Surrogate Assisted Monte Carlo Tree Search in Combinatorial Optimization
Published 14 Mar 2024 in cs.AI | (2403.09925v1)
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.
- Anytime capacity expansion in medical residency match by monte carlo tree search. arXiv preprint arXiv:2202.06570.
- A demand-side approach to the optimal deployment of electric vehicle charging stations in metropolitan areas. Applied Energy, 182: 39–46.
- The generalized maximal covering location problem. Computers & Operations Research, 29(6): 563–581.
- Captivo, M. E. 1991. Fast primal and dual heuristics for the p-median location problem. European Journal of Operational Research, 52(1): 65–74.
- The maximal covering location problem. In Papers of the regional science association, volume 32, 101–118. Springer-Verlag Berlin/Heidelberg.
- Coulom, R. 2006. Efficient selectivity and backup operators in Monte-Carlo tree search. In International conference on computers and games, 72–83. Springer.
- Facility location when demand is time dependent. Naval Research Logistics (NRL), 38(5): 763–777.
- Dupont, L. 2008. Branch and bound algorithm for a facility location problem with concave site dependent costs. International journal of production economics, 112(1): 245–254.
- Application of multi-objective optimization on the basis of ratio analysis (MOORA) method for bank branch location selection. International Journal of Finance & Banking Studies (2147-4486), 2(2): 41–52.
- A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems. Knowledge-Based Systems, 223: 107049.
- Optimization for allocating BEV recharging stations in urban areas by using hierarchical clustering. In 2010 6th International conference on advanced information management and service (IMS), 460–465. IEEE.
- A branch-and-bound algorithm for seeking the p-median. Operations Research, 20(1).
- An algorithmic approach to network location problems. I: The p-centers. SIAM journal on applied mathematics, 37(3): 513–538.
- Monte carlo tree search in continuous spaces using voronoi optimistic optimization with regret bounds. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, 9916–9924.
- Bandit based monte-carlo planning. In European conference on machine learning. Springer.
- A heuristic program for locating warehouses. Management science, 9(4): 643–666.
- Designing better playlists with monte carlo tree search. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 31, 4715–4720.
- A Gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems. IEEE Transactions on Evolutionary Computation, 18(2): 180–192.
- A bionomic approach to the capacitated p-median problem. Journal of Heuristics, 4(3): 263.
- A hierarchical location model for locating bank branches in a competitive environment. International transactions in operational research, 9(5): 549–565.
- Murray, A. T. 2016. Maximal coverage location problem: impacts, significance, and evolution. International Regional Science Review, 39(1): 5–27.
- Surrogate assisted optimisation for travelling thief problems. In Proceedings of the International Symposium on Combinatorial Search, volume 11, 111–115.
- A decision problem for bank branch site selection: a GIS mapping perspective with maximal covering location problem: a case study of Isfahan, Iran. International Journal of Services and Operations Management, 39(3): 337–361.
- SOLO: search online, learn offline for combinatorial optimization problems. In Proceedings of the International Symposium on Combinatorial Search, volume 12, 97–105.
- A gamma heuristic for the p-median problem. European Journal of Operational Research, 117(3): 522–532.
- Computer poker: A review. Artificial intelligence, 175(5-6): 958–987.
- Santos, A. C. 2009. Solving large p-median problems using a Lagrangean heuristic. Ph.D. thesis, Université Blaise Pascal (Clermont Ferrand 2).
- BigBank: A GIS integrated AHP-TOPSIS based expansion model for banks. In 2019 SITIS, 311–318. IEEE.
- Mastering the game of go without human knowledge. nature, 550(7676): 354–359.
- Monte carlo tree search for trading and hedging. In Proceedings of the Second ACM International Conference on AI in Finance, 1–9.
- Budget constrained location problem with opening and closing of facilities. Computers & Operations Research, 30(13): 2047–2069.
- Wesolowsky, G. O. 1973. Dynamic facility location. Management Science, 19(11): 1241–1248.
- The design of approximation algorithms. Cambridge university press.
- Branch location problems with maximum satisfiability. In ECAI 2020, 379–386. IOS Press.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.