Evolutionary solving of the debts’ clearing problem

[1] D. Bakšys and L. Sakalauskas, Modelling, simulation and optimisation of interbank settlements, Information technology and control36, 1 (2007) 43–52. ⇒143Search in Google Scholar

[2] D. Bakšys and L. Sakalauskas, Simulation and testing of FIFO clearing algorithms, Information technology and control39, 1 (2010) 24–31. ⇒143Search in Google Scholar

[3] L. Davis, Applying adaptive algorithms to epistatic domains, Proceedings of the 9th International Joint Conference on Artificial Intelligence, 162–164, Morgan Kaufmann, 1985. ⇒148Search in Google Scholar

[4] V. Gazda, Mutual debts compensation as graph theory application, Challenges for Business Administrators in the New Millennium, 793–811, 2000. ⇒143Search in Google Scholar

[5] V. Gazda, Mutual debts compensation as graph theory problem, Mathematical Finance, 162–167, Springer, 2001. ⇒14310.1007/978-3-0348-8291-0_15Search in Google Scholar

[6] V. Gazda, D. Horváth and M. Rešovsk`y, An application of graph theory in the process of mutual debt compensation, Acta Polytechnica Hungarica12, 3 (2015) 7–24. ⇒14310.12700/APH.12.3.2015.3.1Search in Google Scholar

[7] D. Goldberg and R. Lingle, Jr. Alleles, loci, and the traveling salesman problem, Proceedings of the 1st International Conference on Genetic Algorithms and their Applications, 154–159, Lawrence Erlbaum Associates, 1985. ⇒147, 148Search in Google Scholar

[8] M. Gorges-Schleuter, Genetic algorithms and population structure - A massively parallel algorithm, Ph.D. thesis, University of Dortmund, 1990. ⇒148Search in Google Scholar

[9] M. M. Güntzer, D. Jungnickel and M. Leclerc, E cient algorithms for the clearing of interbank payments, European Journal of Operational Research106, 1 (1998) 212–219. ⇒14310.1016/S0377-2217(97)00265-8Search in Google Scholar

[10] J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, 1975. ⇒149Search in Google Scholar

[11] G. J. Krishna and V. Ravi, Evolutionary computing applied to solve some operational issues in banks, Optimization in Industry 31–53, Springer, 2019. ⇒14310.1007/978-3-030-01641-8_3Search in Google Scholar

[12] I. Oliver, D. Smith and J. Holland, A study of permutation crossover operators on the traveling salesman problem, Proceedings of the Second International Conference on Genetic Algorithms, 224–230, Lawrence Erlbaum Associates, 1987. ⇒147, 148Search in Google Scholar

[13] C. Păatcaş, On the debts’ clearing problem, Studia Universitatis Babeş-Bolyai Series Informatica, 54, 2 (2009) 109–120. ⇒143, 144, 145, 146,151, 155Search in Google Scholar

[14] C. Păatcaş, The debts’ clearing problem: a new approach, Acta Universitatis Sapientiae, Informatica, 3, 2 (2011) 192–204. ⇒143, 151, 155Search in Google Scholar

[15] C. Păatcaş, The debts’ clearing problem’s relation with complexity classes, Acta Mathematica Academiae Paedagogicae Nyíregyháziensis, 28, 2 (2012) 217–226. ⇒143, 150Search in Google Scholar

[16] A. C. Shapiro, Payments netting in international cash management, Journal of International Business Studies, 9, 2 (1978) 51–58. ⇒14210.1057/palgrave.jibs.8490661Search in Google Scholar

[17] Y. M. Shafransky and A. A. Doudkin, An optimization algorithm for the clearing of interbank payments, European Journal of Operational Research, 171, 3 (2006) 743–749. ⇒14310.1016/j.ejor.2004.09.003Search in Google Scholar

[18] V. Srinivasan and Y. H. Kim, Payments netting in international cash management: a network optimization approach, Journal of International Business Studies, 17, 2 (1986) 1–20. ⇒142, 14310.1057/palgrave.jibs.8490421Search in Google Scholar

[19] G. Syswerda, Schedule optimization using genetic algorithms, Handbook of Genetic Algorithms, 332–349, Van Nostrand Reingold, 1991. ⇒148Search in Google Scholar

[20] A. J. Umbarkar and P. D. Sheth, Crossover operators in genetic algorithms: a review, ICTACT journal on soft computing, 6, 1, 2015 ⇒148Search in Google Scholar

[21] T. Verhoe, Settling multiple debts e ciently: an invitation to computing science, Informatics in Education, 3, 1 (2004), 105–126. ⇒143, 145, 14610.15388/infedu.2004.08Search in Google Scholar

[22] D. Whitley, T. Starkwater and D. Fuquay, Scheduling problems and traveling salesmen: The genetic edge recombination operator, Proceedings of the Third International Conference on Genetic Algorithms, 133–140, Morgan Kaufmann Publishers, 1989. ⇒147, 148Search in Google Scholar

[23] J. Wróblewski, Theoretical foundations of order-based genetic algorithms, Fundamenta Informaticae28, 3-4 (1996) 423–430. ⇒14810.3233/FI-1996-283414Search in Google Scholar