Publications de l'Institut Mathematique 2012 Volume 92, Issue 106, Pages: 25-34
https://doi.org/10.2298/PIM1206025L
Full text ( 420 KB)
An integer linear programming formulation and genetic algorithm for the maximum set splitting problem
Lazović Bojana (Faculty of Mathematics, Belgrade)
Marić Miroslav (Faculty of Mathematics, Belgrade)
Filipović Vladimir (Faculty of Mathematics, Belgrade)
Savić Aleksandar (Faculty of Mathematics, Belgrade)
We consider the maximum set splitting problem (MSSP). For the first time an
integer linear programming (ILP) formulation is presented and validity of
this formulation is given. We propose a genetic algorithm (GA) that uses the
binary encoding and the standard genetic operators adapted to the problem.
The overall performance of the GA implementation is improved by a caching
technique. Experimental results are performed on two sets of instances from
the literature: minimum hitting set and Steiner triple systems. The results
show that CPLEX optimally solved all hitting set instances up to 500 elements
and 10000 subsets. Also, it can be seen that GA routinely reached all optimal
solutions up to 500 elements and 50000 subsets. The Steiner triple systems
seems to be much more challenging for maximum set splitting problems since
the CPLEX solved to optimality, within two hours, only two instances up to 15
elements and 35 subsets. For these instances GA reached all solutions as
CPLEX but in much smaller running time.
Keywords: genetic algorithm, set splitting, Steiner triple systems
Projekat Ministarstva nauke
Republike Srbije, br. 174010