Cash Flow Minimiser System Using Max Heap
Keywords:
Algorithm, Banks, Max heap, Optimization, Payments, TransactionsAbstract
In this paper, we introduce a new algorithm that is intended to optimize cash flow between banks with the aim of reducing both the quantity and value of transactions. The algorithm considers the payment types that each bank supports which enables identification of net debtor and creditor banks. By leveraging common payment types and facilitating the transfer of funds between these banks, the algorithm ensures more efficient financial interactions. This optimization leads to reduced operational costs and improved overall management in facilitating banking transactions. We evaluate the algorithm’s effectiveness through detailed simulations and offer insights into its practical implications in real-world banking scenarios, demonstrating its potential to streamline financial operations and enhance cost-efficiency. A max heap data structure is utilized to improve the algorithm’s efficiency.
References
M. A Weiss, “Data Structures and Algorithm Analysis in C++”, 4th ed. Pearson,
R. Kavale, “Max Heap and Min Heap,” OpenGenus IQ: Learn Algorithms, DL, System Design, Jun. 25, 2019. https://iq.opengenus.org/max-heap-min-heap/
A. V. Goldberg and R. E. Tarjan, “A new approach to the maximum-flow problem,” Journal of the ACM, vol. 35, no. 4, pp. 921–940, Oct. 1988, doi: https://doi.org/10.1145/48014.61051
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. Cambridge, MA, USA: MIT Press, 2009.
R. Sedgewick and K. Wayne, Algorithms, 4th ed. Boston, MA, USA: Addison-Wesley, 2011.
P. Kanellopoulos, M. Kyropoulou, and H. Zhou, “Debt Transfers in Financial Networks: Complexity and Equilibria,” IFAAMAS, 2023. Accessed: Apr. 02, 2025. [Online]. Available: https://www.ifaamas.org/Proceedings/aamas2023/pdfs/p260.pdf
T. VERHOEFF, “Settling Multiple Debts Efficiently: An Invitation to Computing Science,” Informatics in Education, vol. 3, no. 1, pp. 105–126, Apr. 2004, doi: https://doi.org/10.15388/infedu.2004.08.
J. Kleinberg and É. Tardos, Algorithm Design, Boston, MA, USA: Addison-Wesley, 2005.
F. J. Brandenburg and M. Cai, “Shortest path and maximum flow problems in networks with additive losses and gains,” Theoretical Computer Science, vol. 412, no. 4–5, pp. 391–401, Feb. 2011, doi: https://doi.org/10.1016/j.tcs.2010.11.019.
T. H. Cormen and C. E. Leiserson, Algorithms Unlocked. Cambridge, MA, USA: MIT Press, 2010 D. E. Knuth, The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed. Boston, MA, USA: Addison-Wesley, 1998.
D. E. Knuth, The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed. Boston, MA, USA: Addison-Wesley, 1998.
