Evolutionary solving of the debts' clearing problem

02/26/2014
by   Csaba Patcas, et al.
0

The debts' clearing problem is about clearing all the debts in a group of n entities (persons, companies etc.) using a minimal number of money transaction operations. The problem is known to be NP-hard in the strong sense. As for many intractable problems, techniques from the field of artificial intelligence are useful in finding solutions close to optimum for large inputs. An evolutionary algorithm for solving the debts' clearing problem is proposed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2010

Evolutionary Computation Algorithms for Cryptanalysis: A Study

The cryptanalysis of various cipher problems can be formulated as NP-Har...
research
08/04/2020

Creative AI Through Evolutionary Computation: Principles and Examples

The main power of artificial intelligence is not in modeling what we alr...
research
02/08/2012

A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm

Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithm...
research
07/16/2021

On the complexity of open shop scheduling with time lags

The minimization of makespan in open shop with time lags has been shown ...
research
02/14/2006

On the utility of the multimodal problem generator for assessing the performance of Evolutionary Algorithms

This paper looks in detail at how an evolutionary algorithm attempts to ...
research
07/23/2019

ISEA: Image Steganalysis using Evolutionary Algorithms

NP-hard problems always have been attracting scientists' attentions, and...
research
09/16/2023

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees

Satisfiability Modulo Counting (SMC) encompasses problems that require b...

Please sign up or login with your details

Forgot password? Click here to reset