BalMCTS: Balancing Objective Function and Search Nodes in MCTS for Constraint Optimization Problems (2312.15864v1)
Abstract: Constraint Optimization Problems (COP) pose intricate challenges in combinatorial problems usually addressed through Branch and Bound (B&B) methods, which involve maintaining priority queues and iteratively selecting branches to search for solutions. However, conventional approaches take a considerable amount of time to find optimal solutions, and it is also crucial to quickly identify a near-optimal feasible solution in a shorter time. In this paper, we aim to investigate the effectiveness of employing a depth-first search algorithm for solving COP, specifically focusing on identifying optimal or near-optimal solutions within top $n$ solutions. Hence, we propose a novel heuristic neural network algorithm based on MCTS, which, by simultaneously conducting search and training, enables the neural network to effectively serve as a heuristic during Backtracking. Furthermore, our approach incorporates encoding COP problems and utilizing graph neural networks to aggregate information about variables and constraints, offering more appropriate variables for assignments. Experimental results on stochastic COP instances demonstrate that our method identifies feasible solutions with a gap of less than 17.63% within the initial 5 feasible solutions. Moreover, when applied to attendant Constraint Satisfaction Problem (CSP) instances, our method exhibits a remarkable reduction of less than 5% in searching nodes compared to state-of-the-art approaches.
- Solving np-hard problems on graphs with extended alphago zero. arXiv preprint arXiv:1905.11623.
- Mixed integer programming: Analyzing 12 years of progress. In Facets of combinatorial optimization: Festschrift for martin grötschel, 449–481. Springer.
- Bertsekas, D. P. 2014. Constrained optimization and Lagrange multiplier methods. Academic press.
- MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In International Conference on Principles and Practice of Constraint Programming, 61–75. Springer.
- Deep Attentive Belief Propagation: Integrating Reasoning and Learning for Solving Constraint Optimization Problems. Advances in Neural Information Processing Systems, 35: 25436–25449.
- Decentralised coordination of low-power embedded devices using the max-sum algorithm.
- Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428.
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Mathematical Programming Computation, 13(3): 443–490.
- Increasing tree search efficiency for constraint satisfaction problems. Artificial intelligence, 14(3): 263–313.
- A method for stochastic optimization. In International conference on learning representations (ICLR), volume 5, 6. San Diego, California;.
- Factor graphs and the sum-product algorithm. IEEE Transactions on information theory, 47(2): 498–519.
- Improving degree-based variable ordering heuristics for solving constraint satisfaction problems. Journal of Heuristics, 22: 125–145.
- On learning and branching: a survey. Top, 25: 207–236.
- Bandit-based search for constraint programming. In Principles and Practice of Constraint Programming: 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings 19, 464–480. Springer.
- ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2): 149–180.
- Refalo, P. 2004. Impact-based search strategies for constraint programming. In Principles and Practice of Constraint Programming–CP 2004: 10th International Conference, CP 2004, Toronto, Canada, September 27-October 1, 2004. Proceedings 10, 557–571. Springer.
- Decomposing utility functions in bounded max-sum for distributed constraint optimization. In International conference on principles and practice of constraint programming, 646–654. Springer.
- Guiding combinatorial optimization with UCT. In Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems: 9th International Conference, CPAIOR 2012, Nantes, France, May 28–June1, 2012. Proceedings 9, 356–361. Springer.
- Real-time solving of quantified csps based on monte-carlo game tree search. In Twenty-Second International Joint Conference on Artificial Intelligence. Citeseer.
- Learning to branch with tree mdps. Advances in Neural Information Processing Systems, 35: 18514–18526.
- Mastering the game of go without human knowledge. nature, 550(7676): 354–359.
- Learning variable ordering heuristics for solving Constraint Satisfaction Problems. Eng. Appl. Artif. Intell., 109: 104603.
- ToulBar2, an open source exact cost function network solver.
- Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artificial intelligence, 171(8-9): 514–534.
- How Powerful are Graph Neural Networks? In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net.
- First-order problem solving through neural mcts based reinforcement learning. arXiv preprint arXiv:2101.04167.