Vani Suthamathi Saravanarajan
ABSTRACT
In many real-world problems, random variables influence the outcome of a decision-making process. All those variables and their potential interactions are typically difficult to consider. Under such uncertainty, AI methods are useful tools for generalizing past experiences to produce solutions to the previously unseen instances of the issue. Unbound Knapsack Problems (UKP) are important research topics in many fields like portfolio and asset selection, selection of minimum raw materials to reduce the waste and generating keys for cryptosystems. Given the uncertainty in data, capacity and time constraint, decision-makers have to look at the possible combination of data with maximum return considering both short term and long term returns. This paper applies Monte Carlo Tree Search (MCTS) to solve UKP by selecting the best items for the given knapsack capacity and the modified Upper Confidence Bound (UCB) algorithm for calculating the Cumulative Rewards (CR). We have shown the results of cumulative rewards by increasing the iterations. The experiment result presents not a single solution but a set of optimal solutions. The execution time of MCTS is measured by varying the number of available items. The measurement result shows the improvement in execution time as the number of items increases.
- Sapra, D., Sharma, R., and Agarwal, A. P. 2017. Comparative study of metaheuristic algorithms using Knapsack Problem. Proc. 7th Int. Conf. Conflu.2017 Cloud Comput. Data Sci. Eng., pp. 134--137.Google Scholar
- Scheithauer, G. 2018. Knapsack problems. International Series in Operations Research and Management Science.Google Scholar
- Matai, R., Singh, S., and Lal, M. 2010. Traveling Salesman Problem: An Overview of Applications, Formulations, and Solution Approaches. Travel. Salesm. Probl. Theory Appl.Google Scholar
- Dean, B. C., Goemans, M. X., and Vondrák, J. 2008. Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res., 2008, doi: 10.1287/moor.1080.0330. Google ScholarDigital Library
- McMurray, A., Pearson, T., and Felipe, Casarim,. 2017. Guidance on Applying the Monte Carlo Approach.Google Scholar
- Magnuson, M. 2015. Monte Carlo Tree Search and Its Applications. Morris Undergrad. J.Google Scholar
- Kovari, B., Becsi, T., Szabo, A., and Aradi, S. 2020. Policy Gradient Based Control of a Pneumatic Actuator Enhanced with Monte Carlo Tree Search. 6th International Conference on Mechatronics and Robotics Engineering, ICMRE 2020. doi: 10.1109/ICMRE49073.2020.9065122.Google Scholar
- Sauer, T. 2012. Numerical solution of stochastic differential equations in finance. Handbook of Computational Finance.Google Scholar
- Silva, S. A., Abreu, P.H.C. d., Amorim, F.R.d., and Santos, D. F. L. 2019. Application of Monte Carlo Simulation for Analysis of Costs and Economic Risks in a Banking Agency. IEEE Latin America Transactions, vol. 17, no. 03, pp. 409--417, doi: 10.1109/TLA.2019.8863311.Google ScholarCross Ref
- Liu, G., Shi, W., and Zhang, K. 2001. An Upper Confidence Bound Approach to Estimating Coherent Risk Measures. Proc. - Winter Simul. Conf., vol. 2019-December. pp. 914--925, 2019, doi: 10.1109/WSC40007.2019.9004921. Google ScholarDigital Library
- Yang, J., Hou, X., Hu, Y. H., Liu, Y., and Pan, Q. 2020. A Reinforcement Learning Scheme for Active Multi-debris Removal Mission Planning with Modified Upper Confidence Bound Tree Search. IEEE Access, pp. 1--1, doi: 10.1109/access.2020.3001311.Google Scholar
- Carpentier, A., Lazaric, A., Ghavamzadeh, M., Munos, R., and Auer, P. 2011. Upper-confidence-bound algorithms for active learning in multi-armed bandits. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), doi: 10.1007/978-3-642-24412-4_17. Google ScholarDigital Library
- Montecarlo Approach For Solving Unbound Knapsack Problem
Recommendations
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation
The Temporal Knapsack Problem (TKP) is a generalization of the standard Knapsack Problem where a time horizon is considered, and each item consumes the knapsack capacity during a limited time interval only. In this paper we solve the TKP using what we ...
Exact Solution of the Quadratic Knapsack Problem
<P>The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coefficients are assumed to be nonnegative and all variables are binary. The problem has applications in location and ...
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem
In this paper we will consider the 0-1 quadratic knapsack problem (QKP). Our purpose is to show that using a linear reformulation of this problem and a standard mixed integer programming tool, it is possible to solve the QKP efficiently in terms of ...
Comments