Main Article Content

Abstract

Strategy in a competitive video game is needed to reach a successful game, for example, Valorant. Route planning is one of the strategies in playing games. In consideration of making a new strategy, this research develops a binary integer programming (BIP) model to generating optimal route depending on passable paths, travel time, kills, and survivability. By using POM QM for Windows to compute the model, we obtained optimal modified routes that can be combined in the role and agent composition.

Keywords

Valorant Haven Binary Integer Programming Post-match strategy route planning

Article Details

Author Biographies

Ermelinda Benna Kireyna, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Undergraduate Student of Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Jovian Dian Pratama, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Lecturer in Mathematics at Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Mauliddino Rizky Pratama, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Undergraduate Student of Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Sri Lutfiya Dwiyeni, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Undergraduate Student of Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Apni Diyanti, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Undergraduate Student of Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Bernardinus Rico Dewanto, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Undergraduate Student of Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Sunarsih, Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

Professor of Applied Mathematics - Ecology Modelling at Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University

References

  1. [1] D. Chaundy, “Most Played Games in 2023, Ranked by Average Monthly Players.” https://twinfinite.net/features/most-played-games/ (accessed Sep. 21, 2023).
  2. [2] Polygon, “Valorant: Everything we know about Riot Games’ new shooter” https://www.polygon.com/2020/3/2/21155158/valorant-project-a-riot-games-shooter (accessed Sep. 21, 2023).
  3. [3] S. Gunpinar and G. Centeno, “An integer programming approach to the bloodmobile routing problem,” Transp Res E Logist Transp Rev, vol. 86, pp. 94–115, Feb. 2016, doi: 10.1016/j.tre.2015.12.005.
  4. [4] S. Wang, W. Zhang, Y. Bie, K. Wang, and A. Diabat, “Mixed-integer second-order cone programming model for bus route clustering problem,” Transp Res Part C Emerg Technol, vol. 102, pp. 351–369, May 2019, doi: 10.1016/j.trc.2019.03.019.
  5. [5] M. J. Mauricio, P. J. de Rezende, and C. C. de Souza, “Solving the geometric firefighter routing problem via integer programming,” Eur J Oper Res, vol. 274, no. 3, pp. 1090–1101, May 2019, doi: 10.1016/J.EJOR.2018.10.037.
  6. [6] Q. Xue, X. Yang, J. Wu, H. Sun, H. Yin, and Y. Qu, “Urban rail timetable optimization to improve operational efficiency with flexible routing plans: A nonlinear integer programming model,” Sustainability (Switzerland), vol. 11, no. 13, 2019, doi: 10.3390/su11133701.
  7. [7] C. Ntakolia and D. K. Iakovidis, “A route planning framework for smart wearable assistive navigation systems,” SN Appl Sci, vol. 3, no. 1, 2021, doi: 10.1007/s42452-020-04038-6.
  8. [8] Z. Huang, W. Huang, and F. Guo, “Integrated sustainable planning of micro-hub network with mixed routing strategy,” Comput Ind Eng, vol. 149, 2020, doi: 10.1016/j.cie.2020.106872.
  9. [9] C. Iliopoulou and K. Kepaptsoglou, “Integrated transit route network design and infrastructure planning for on-line electric vehicles,” Transp Res D Transp Environ, vol. 77, pp. 178–197, Dec. 2019, doi: 10.1016/J.TRD.2019.10.016.
  10. [10] K. Balaji and M. Rabiei, “Carbon dioxide pipeline route optimization for carbon capture, utilization, and storage: A case study for North-Central USA,” Sustainable Energy Technologies and Assessments, vol. 51, 2022, doi: 10.1016/j.seta.2021.101900.
  11. [11] X. Li, D. Li, X. Hu, Z. Yan, and Y. Wang, “Optimizing train frequencies and train routing with simultaneous passenger assignment in high-speed railway network,” Comput Ind Eng, vol. 148, 2020, doi: 10.1016/j.cie.2020.106650.
  12. [12] L. Wang, S. Gao, K. Wang, T. Li, L. Li, and Z. Chen, “Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility,” J Adv Transp, vol. 2020, 2020, doi: 10.1155/2020/3030197.
  13. [13] W. Liu et al., “A hybrid ACS-VTM algorithm for the vehicle routing problem with simultaneous delivery & pickup and real-time traffic condition,” Comput Ind Eng, vol. 162, 2021, doi: 10.1016/j.cie.2021.107747.
  14. [14] J. X. Cao, X. Wang, and J. Gao, “A two-echelon location-routing problem for biomass logistics systems,” Biosyst Eng, vol. 202, 2021, doi: 10.1016/j.biosystemseng.2020.12.007.
  15. [15] S. K. Seo, Y. G. Yoon, J. sung Lee, J. Na, and C. J. Lee, “Deep Neural Network-based Optimization Framework for Safety Evacuation Route during Toxic Gas Leak Incidents,” Reliab Eng Syst Saf, vol. 218, p. 108102, Feb. 2022, doi: 10.1016/J.RESS.2021.108102.
  16. [16] F. K. Asare, “Application of Integer Programming for Mine Evacuation Modeling with Multiple Transportation Modes,” M. S. Thesis, College of Eng., University of Nevada, Reno, 2023. [Online] Available: https://search.proquest.com/openview/1b0e1fa907603ab449b4a6e2e5ea8f38/1?pq-origsite=gscholar&cbl=18750&diss=y
  17. [17] K. F. Krutein and A. Goodchild, “The isolated community evacuation problem with mixed integer programming,” Transp Res E Logist Transp Rev, vol. 161, 2022, doi: 10.1016/j.tre.2022.102710.
  18. [18] C. Chen, P. Yang, and S. Liu, “The Mission Planning of Multi-wave Missile Launching Based on 0-1 Integer Programming,” 2020.
  19. [19] F. F. Fibriyanto, “Penentuan Rute Rotasi Tercepat Dalam Map Breeze Gim Valorant Menggunakan Algoritma Dijkstra Makalah,” 2021, diakses: Mar. 24, 2023. [Online]. Available: https://informatika.stei.itb.ac.id/~rinaldi.munir/Matdis/2021-2022/Makalah2021/Makalah-Matdis-2021%20(59).pdf
  20. [20] J. Heath, “All VALORANT classes and roles, Explained” https://dotesports.com/valorant/news/all-valorant-classes-explained (accessed Sep. 21, 2023).
  21. [21] Valorant Wiki, “Agents | Valorant Wiki | Fandom.” https://valorant.fandom.com/wiki/Agents (diakses Sep. 21, 2023).
  22. [22] VLR.gg, “Valorant Champions 2022: Brackets, Groups, and Standings | Valorant Event” https://www.vlr.gg/event/1015/valorant-champions-2022 (accessed Sep. 21, 2023).