Advertisement

Securities and Cash Settlement Framework

  • Ekaterina AlekseevaEmail author
  • Sana Ghariani
  • Nicolas Wolters
Conference paper
  • 200 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12095)

Abstract

The securities settlement process consists in delivering securities from one financial actor to another in exchange for payment in currency. Each business day has a night-time settlement (NTS) period when transactions (exchange of cash and/or security for payment) are settled in batches. Banque de France is inter alia in charge of Mathematical Optimization Module (MOM) for the NTS period which is a component of a large European platform. To reduce the number of failed transactions some additional financial features can be triggered, such as partial settlement of eligible transactions and provision of credit (auto-collateralisation mechanism). MOM must settle as many transactions as possible respecting all business constraints and taking advantage of these financial features. Furthermore, MOM execution time is limited, the data size is large (several hundred thousands of transactions over a billion euro) and the number of transactions and their amounts require high numerical precision. In this work we introduce the necessary financial notions, explain the NTS process and formulate it as a discrete optimisation model. We expose heuristic, mixed integer and linear programming algorithmic approaches used to solve this large-scale problem. We present results obtained on production data and discuss some perspectives.

Keywords

Application of OR in finance Discrete large-scale optimization Mathematical programming Heuristics 

References

  1. 1.
    Asbjørn, E., Øverli, F.: Intraday liquidity and the settlement of large-value payments: a simulation-based analysis. Econ. Bull. 1(LXXVII), 41–48 (2006) Google Scholar
  2. 2.
    Güntzer, M.M., Jungnickel, D., Leclerc, M.: Efficient algorithms for the clearing of interbank payments. Eur. J. Oper. Res. 106(1), 212–219 (1998)CrossRefGoogle Scholar
  3. 3.
    Klotz, E., Newman, A.M.: Practical guidelines for solving difficult linear programs. Surv. Oper. Res. Manag. Sci. 18, 18–32 (2013)MathSciNetGoogle Scholar
  4. 4.
    Leinonen, H.: Liquidity, risks and speed in payment and settlement systems: a simulation approach. Bank of Finland Studies (2005)Google Scholar
  5. 5.
    Leinonen, H., Soramaki, K.: Simulation: a powerful research tool in payment and settlement systems. Paym. Syst. Worldw. 15, 28–33 (2004)Google Scholar
  6. 6.
    Manfred, G., Maringer, D., Schumann, E.: Numerical Methods and Optimization in Finance. Academic Press, Cambridge (2019)zbMATHGoogle Scholar
  7. 7.
    Shafransky, Y.M., Doudkin, A.A.: An optimization algorithm for the clearing of interbank payments. Eur. J. Oper. Res. 171(3), 743–749 (2006)CrossRefGoogle Scholar
  8. 8.
    Sutcliffe, B.J., Charles, Z., William, T.: Applying operations research techniques to financial markets. Interfaces 33, 12–24 (2003)Google Scholar
  9. 9.
    Toth, P., Martello, S.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)zbMATHGoogle Scholar
  10. 10.
  11. 11.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Ekaterina Alekseeva
    • 1
    Email author
  • Sana Ghariani
    • 1
  • Nicolas Wolters
    • 1
  1. 1.Banque de FranceParisFrance

Personalised recommendations