IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i1d10.1007_s43069-023-00272-x.html
   My bibliography  Save this article

Development of a Heuristic Based Mixed Integer Linear Programming Model for Resources Allocation During Cyberfraud Mitigation

Author

Listed:
  • Oluwatoyin Esther Akinbowale

    (Tshwane University of Technology)

  • Polly Mashigo

    (Tshwane University of Technology)

  • Mulatu Fekadu Zerihun

    (Tshwane University of Technology)

Abstract

In this digital era, cyberfraud remains one of the major challenges faced by individuals and financial institutions. Lack of suitable decision support systems for effective allocation of resources affects the success rate in combating the crime. Thus, the purpose of this study is to develop a mixed integer linear programming model that can assist financial institutions to make proactive decisions about resource allocation in their response to cyberthreats using the South African banking industry as a case study. To achieve this, literature review was carried out and the components of an organisation’s cyber-incidence response plans were established. These are the following: cyber-incidence identification, detection, protection, response, and recovery. Mathematical formulations for the optimisation of the cost of resource allocation and connections among the banking head offices, branches and automated teller machine (ATM) outlets were established. The formulation was carried out using mixed-integer linear programming (MILP). The heuristic algorithm found the optimal objective function value of $$2.4382\times\,{10}^{6}$$ 2.4382 × 10 6 at the 13th iteration at node 0 after exploring 32 nodes for the first objective while the algorithm found the optimal objective function value of 3872.00 at the 120th iteration at node 50 after exploring 55 nodes for the second objective function. The results obtained from the MILP model indicated that the heuristic algorithm can be used for the ordering, sequencing, and assignment of tasks to the antifraud teams at minimum costs. It can also be used to establish the best possible connection among these facilities to ensure a quick incidence response during cyberattack. Hence, the implementation of the MILP model for cost minimisation and effective allocation and utilisation of human resources to combat cyberfraud is recommended.

Suggested Citation

  • Oluwatoyin Esther Akinbowale & Polly Mashigo & Mulatu Fekadu Zerihun, 2024. "Development of a Heuristic Based Mixed Integer Linear Programming Model for Resources Allocation During Cyberfraud Mitigation," SN Operations Research Forum, Springer, vol. 5(1), pages 1-27, March.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00272-x
    DOI: 10.1007/s43069-023-00272-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-023-00272-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-023-00272-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dong Li & Li Ding & Stephen Connor, 2020. "When to Switch? Index Policies for Resource Scheduling in Emergency Response," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 241-262, February.
    2. Armin Mahmoodi & Leila Hashemi & Milad Jasemi & Soroush Mehraban & Jeremy Laliberté & Richard C. Millar, 2023. "A developed stock price forecasting model using support vector machine combined with metaheuristic algorithms," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 59-86, March.
    3. Oluwatoyin Esther Akinbowale & Heinz Eckart Klingelhöfer & Mulatu Fikadu Zerihun, 2020. "An innovative approach in combating economic crime using forensic accounting techniques," Journal of Financial Crime, Emerald Group Publishing Limited, vol. 27(4), pages 1253-1271, July.
    4. Lagazio, Monica & Sherif, Nazneen & Cushman, Mike, 2014. "A multi-level approach to understanding the impact of cyber crime on the financial sector," LSE Research Online Documents on Economics 57000, London School of Economics and Political Science, LSE Library.
    5. Kyung Sung Jung & Michael Pinedo & Chelliah Sriskandarajah & Vikram Tiwari, 2019. "Scheduling Elective Surgeries with Emergency Patients at Shared Operating Rooms," Production and Operations Management, Production and Operations Management Society, vol. 28(6), pages 1407-1430, June.
    6. Gilbert Laporte & Paolo Toth, 2022. "A gap in scientific reporting," 4OR, Springer, vol. 20(1), pages 169-171, March.
    7. Oluwatoyin Esther Akinbowale & Heinz Eckart Klingelhöfer & Mulatu Fekadu Zerihun, 2023. "Application of forensic accounting techniques in the South African banking industry for the purpose of fraud risk mitigation," Cogent Economics & Finance, Taylor & Francis Journals, vol. 11(1), pages 2153412-215, December.
    8. Doole, Malik & Ellerbroek, Joost & Hoekstra, Jacco, 2020. "Estimation of traffic density from drone-based delivery in very low level urban airspace," Journal of Air Transport Management, Elsevier, vol. 88(C).
    9. Sani Abubakar Saddiq & Abu Sufian Abu Bakar, 2019. "Impact of economic and financial crimes on economic growth in emerging and developing countries," Journal of Financial Crime, Emerald Group Publishing Limited, vol. 26(3), pages 910-920, July.
    10. Robert Bixby & Edward Rothberg, 2007. "Progress in computational mixed integer programming—A look back from the other side of the tipping point," Annals of Operations Research, Springer, vol. 149(1), pages 37-41, February.
    11. Teeradech Laisupannawong & Boonyarit Intiyot & Chawalit Jeenanunta, 2021. "Mixed-Integer Linear Programming Model and Heuristic for Short-Term Scheduling of Pressing Process in Multi-Layer Printed Circuit Board Manufacturing," Mathematics, MDPI, vol. 9(6), pages 1-25, March.
    12. Ji, P. & Sze, M. T. & Lee, W. B., 2001. "A genetic algorithm of determining cycle time for printed circuit board assembly lines," European Journal of Operational Research, Elsevier, vol. 128(1), pages 175-184, January.
    13. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    14. Özlen, Melih & Azizoglu, Meral, 2009. "Multi-objective integer programming: A general approach for generating all non-dominated solutions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 25-35, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jifan Zhang & Salih Tutun & Samira Fazel Anvaryazdi & Mohammadhossein Amini & Durai Sundaramoorthi & Hema Sundaramoorthi, 2024. "Management of resource sharing in emergency response using data-driven analytics," Annals of Operations Research, Springer, vol. 339(1), pages 663-692, August.
    2. Amar K. Narisetty & Jean-Philippe P. Richard & George L. Nemhauser, 2011. "Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 416-424, August.
    3. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
    4. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    5. Cao, Dingzhou & Murat, Alper & Chinnam, Ratna Babu, 2013. "Efficient exact optimization of multi-objective redundancy allocation problems in series-parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 111(C), pages 154-163.
    6. José Niño-Mora, 2020. "Fast Two-Stage Computation of an Index Policy for Multi-Armed Bandits with Setup Delays," Mathematics, MDPI, vol. 9(1), pages 1-36, December.
    7. Xiaoyi Gu & Santanu S. Dey & Jean-Philippe P. Richard, 2024. "Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 884-899, May.
    8. Ali, Agha Iqbal & O'Connor, Debra J., 2010. "The impact of distribution system characteristics on computational tractability," European Journal of Operational Research, Elsevier, vol. 200(2), pages 323-333, January.
    9. Oguz, Osman, 2010. "Cutting plane algorithms for 0-1 programming based on cardinality cuts," European Journal of Operational Research, Elsevier, vol. 205(2), pages 273-279, September.
    10. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    11. Peterson K. Ozili, 2023. "Forensic accounting research around the world," Journal of Financial Reporting and Accounting, Emerald Group Publishing Limited, vol. 23(1), pages 128-153, September.
    12. Martijn Merwe & Melih Ozlen & John W. Hearne & James P. Minas, 2017. "Dynamic rerouting of vehicles during cooperative wildfire response operations," Annals of Operations Research, Springer, vol. 254(1), pages 467-480, July.
    13. Shyam S. G. Perumal & Jesper Larsen & Richard M. Lusby & Morten Riis & Tue R. L. Christensen, 2022. "A column generation approach for the driver scheduling problem with staff cars," Public Transport, Springer, vol. 14(3), pages 705-738, October.
    14. Burdett, Robert & Kozan, Erhan, 2016. "A multi-criteria approach for hospital capacity analysis," European Journal of Operational Research, Elsevier, vol. 255(2), pages 505-521.
    15. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    16. Arne Schulz & Malte Fliedner, 2023. "Minimizing the expected waiting time of emergency jobs," Journal of Scheduling, Springer, vol. 26(2), pages 147-167, April.
    17. Amaro Sousa & Carlos Borges Lopes & Paulo Monteiro, 2016. "Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 189-213, May.
    18. Gökalp, E. & Gülpınar, N. & Doan, X.V., 2023. "Dynamic surgery management under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(2), pages 832-844.
    19. Nwana, V. & Darby-Dowman, K. & Mitra, G., 2005. "A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound," European Journal of Operational Research, Elsevier, vol. 164(1), pages 12-23, July.
    20. Kirlik, Gokhan & Sayın, Serpil, 2014. "A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 479-488.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-023-00272-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.