«Back to research topics list
Graphbased problems described here concern finding characteristic subgraphs and finding good strategies for preventing the spread of a threat in a graph.
«Back to research topics list
Graphbased Problems
The Firefighter Problem (FFP)
The firefighter problem is a graphbased optimization problem that can be used for modelling the spread of fires, and also for studying the dynamics of epidemics. The original version of the firefighter problem was single objective. Description of the problem:

An example for a permutation
P = 3, 4, 2, 1, 6, 7, 8, 9, 10, 5 and the initial burning node #2 (click the images to enlarge) t = 0 t = 1 t = 2 t = 3 t = 4 
EDLS  A Heuristic Local Search for the Multiobjective Firefighter Problem
FFP problem instances used to test the EDLS method are available for download here. 
Simheuristics for the Multiobjective Nondeterministic Firefighter Problem
The research presented in a paper at the EvoStar 2016 Conference. Highlights of the paper:


The SimEA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem
The research presented in a paper at the EvoStar 2015 Conference. Highlights of the paper:


Autoadaptation of Genetic Operators for Multiobjective Optimization in the Firefighter Problem
The research presented in a paper at the IDEAL 2014 Conference. Highlights of the paper:


Papers on evolutionary graph mining for detection of suspicious banking transaction
The research presented in two papers, at the FedCSIS 2011 Conference and in a journal paper. Highlights of the papers:

