AN ELECTROMAGNETISM-LIKE METHOD FOR THE MAXIMUM SET SPLITTING PROBLEM

Abstract : In this paper, an electromagnetism-like approach (EM) for solving the maximum set splitting problem (MSSP) is applied. Hybrid approach consisting of the movement based on the attraction-repulsion mechanisms combined with the proposed scaling technique directs EM to promising search regions. Fast implementation of the local search procedure additionally improves the efficiency of overall EM system. The performance of the proposed EM approach is evaluated on two classes of instances from the literature: minimum hitting set and Steiner triple systems. The results show, except in one case, that EM reaches optimal solutions up to 500 elements and 50000 subsets on minimum hitting set instances. It also reaches all optimal/best-known solutions for Steiner triple systems. Keywords : electromagnetism-like metaheuristic, combinatorial optimization, maximum set splitting problem, Steiner triple systems.

[1]  Saharon Shelah,et al.  The stationary set splitting game , 2008, Math. Log. Q..

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Jianer Chen,et al.  Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach , 2009, Algorithmica.

[4]  Aleksandar Kartelj.  ELECTROMAGNETISM METAHEURISTIC ALGORITHM FOR SOLVING THE STRONG MINIMUM ENERGY TOPOLOGY PROBLEM , 2013 .

[5]  Michael R. Fellows,et al.  Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover , 2004, IWPEC.

[6]  Ho-Lung Hung,et al.  Electromagnetism-like method based blind multiuser detection for MC-CDMA interference suppression over multipath fading channel , 2010, 2010 International Symposium on Computer, Communication, Control and Automation (3CA).

[7]  Saket Saurabh,et al.  Even Faster Algorithm for Set Splitting! , 2009, IWPEC.

[8]  Johan M. M. van Rooij,et al.  Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting , 2010, IPEC.

[9]  Venkatesan Guruswami,et al.  Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses , 2004, Algorithmica.

[10]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[11]  D. R. Fulkerson,et al.  Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[12]  M. M. Ali,et al.  An electromagnetism-like method for nonlinearly constrained global optimization , 2010, Comput. Math. Appl..

[13]  Songjian Lu.  Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics , 2009 .

[14]  Lars Engebretsen,et al.  Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT , 1998, Inf. Process. Lett..

[15]  V. Filipović,et al.  An Integer Linear Programming Formulation and Genetic Algorithm for the Maximum Set Splitting Problem , 2012 .

[16]  Jianer Chen,et al.  Improved Algorithms for Weighted and Unweighted Set Splitting Problems , 2007, COCOON.

[17]  Michael R. Fellows,et al.  An FPT Algorithm for Set Splitting , 2003, WG.

[18]  Alberto García-Villoria,et al.  Solving the response time variability problem by means of the electromagnetism-like mechanism , 2010 .

[19]  Vincenzo Cutello,et al.  A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems , 2005, WIRN/NAIS.

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Xianzhong Dai,et al.  Revised electromagnetism-like mechanism for flow path design of unidirectional AGV systems , 2011 .