Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving Bilevel Knapsack Problem using Graph Neural Networks (2211.13436v3)

Published 24 Nov 2022 in cs.AI, cs.DM, cs.LG, and math.OC

Abstract: The Bilevel Optimization Problem is a hierarchical optimization problem with two agents, a leader and a follower. The leader make their own decisions first, and the followers make the best choices accordingly. The leader knows the information of the followers, and the goal of the problem is to find the optimal solution by considering the reactions of the followers from the leader's point of view. For the Bilevel Optimization Problem, there are no general and efficient algorithms or commercial solvers to get an optimal solution, and it is very difficult to get a good solution even for a simple problem. In this paper, we propose a deep learning approach using Graph Neural Networks to solve the bilevel knapsack problem. We train the model to predict the leader's solution and use it to transform the hierarchical optimization problem into a single-level optimization problem to get the solution. Our model found the feasible solution that was about 500 times faster than the exact algorithm with $1.7\%$ optimal gap. Also, our model performed well on problems of different size from the size it was trained on.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. O. Ben-Ayed and C. E. Blair. Computational difficulties of bilevel linear programming. Operations Research, 38(3):556–560, 1990.
  2. A dynamic programming algorithm for the bilevel knapsack problem. Operations Research Letters, 37(3):215–218, 2009.
  3. One-level reformulation of the bilevel knapsack problem using dynamic programming. Discrete Optimization, 10(1):1–10, 2013.
  4. Combinatorial optimization and reasoning with graph neural networks. arXiv preprint arXiv:2102.09544, 2021.
  5. A study on the computational complexity of the bilevel knapsack problem. SIAM Journal on Optimization, 24(2):823–838, 2014.
  6. L. Chen and G. Zhang. Approximation algorithms for a bi-level knapsack problem. Theoretical Computer Science, 497:1–12, 2013.
  7. Principal neighbourhood aggregation for graph nets. Advances in Neural Information Processing Systems, 33:13260–13271, 2020.
  8. F. Della Croce and R. Scatamacchia. An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Mathematical Programming, 183(1):249–281, 2020.
  9. S. Dempe and K. Richter. Bilevel programming with knapsack constraints. TU Bergakademie, Fakultät für Mathematik und Informatik, 2000.
  10. S. DeNegre. Interdiction and discrete bilevel linear programming. Lehigh University, 2011.
  11. A branch-and-cut algorithm for integer bilevel linear programs. In Operations research and cyber-infrastructure, pages 65–78. Springer, 2009.
  12. Accelerating primal solution findings for mixed integer programs based on solution prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 1452–1459, 2020.
  13. A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations Research, 65(6):1615–1637, 2017.
  14. Exact combinatorial optimization with graph convolutional neural networks. Advances in Neural Information Processing Systems, 32, 2019.
  15. D. Georgiev and P. Lió. Neural bipartite matching. arXiv preprint arXiv:2005.11304, 2020.
  16. Neural message passing for quantum chemistry. In International conference on machine learning, pages 1263–1272. PMLR, 2017.
  17. Online vehicle routing with neural combinatorial optimization and deep reinforcement learning. IEEE Transactions on Intelligent Transportation Systems, 20(10):3806–3817, 2019.
  18. R. G. Jeroslow. The polynomial hierarchy and a simple model for competitive analysis. Mathematical programming, 32(2):146–164, 1985.
  19. An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227, 2019.
  20. S. Jung and M. Keuper. Learning to solve minimum cost multicuts efficiently using edge-weighted graph convolutional neural networks. arXiv preprint arXiv:2204.01366, 2022.
  21. Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems, 30, 2017.
  22. T. N. Kipf and M. Welling. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016.
  23. A survey on mixed-integer programming techniques in bilevel optimization. EURO Journal on Computational Optimization, 9:100007, 2021.
  24. Matrix encoding networks for neural combinatorial optimization. Advances in Neural Information Processing Systems, 34:5138–5149, 2021.
  25. An exact algorithm for bilevel 0-1 knapsack problems. Mathematical Problems in Engineering, 2012, 2012.
  26. The mixed integer linear bilevel programming problem. Operations research, 38(5):911–921, 1990.
  27. Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349, 2020.
  28. X. Qiu and W. Kern. Improved approximation algorithms for a bilevel knapsack problem. Theoretical computer science, 595:120–129, 2015.
  29. J. C. Smith and Y. Song. A survey of network interdiction models and algorithms. European Journal of Operational Research, 283(3):797–811, 2020.
  30. H. v. Stackelberg et al. Theory of the market economy. 1952.
  31. S. Van Hoesel. An overview of stackelberg pricing in networks. European Journal of Operational Research, 189(3):1393–1402, 2008.
  32. Graph attention networks. arXiv preprint arXiv:1710.10903, 2017.
  33. Neural execution of graph algorithms. arXiv preprint arXiv:1910.10593, 2019.
  34. Pointer networks. Advances in neural information processing systems, 28, 2015.
  35. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018.
  36. B. Yildiz. Reinforcement learning using fully connected, attention, and transformer models in knapsack problem solving. Concurrency and Computation: Practice and Experience, 34(9):e6509, 2022.
  37. Graph transformer networks. Advances in neural information processing systems, 32, 2019.
  38. A note on linearized reformulations for a class of bilevel linear integer problems. Annals of Operations Research, 272(1):99–117, 2019.
  39. On exact solution approaches for bilevel quadratic 0–1 knapsack problem. Annals of Operations Research, 298(1):555–572, 2021.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now