Improving Performance in Combinatorial Optimisation Using Averaging and Clustering

Authors:
Mohamed Qasem;Adam Prügel-Bennett
Affiliations:
School of Electronics and Computer Science, University of Southampton, UK SO17 1BJ;School of Electronics and Computer Science, University of Southampton, UK SO17 1BJ
Venue:
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Year:
2009

Citing 7
Cited 0

Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Configuration landscape analysis and backbone guided local search: part I: Satisfiability and maximum satisfiability

Artificial Intelligence
Complexity of Max-SAT using stochastic algorithms

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Learning the large-scale structure of the MAX-SAT landscape using populations

IEEE Transactions on Evolutionary Computation
Symmetry breaking in population-based optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was shown to be an extremely effective search strategy, substantially out-performing traditional optimisation techniques. In this paper we extend those ideas to a second classic NP-Hard problem, namely Vertex Cover. Again the algorithm appears to provide an advantage over more established search algorithms, although it shows different characteristics to MAX-SAT. We argue this is due to the different large-scale landscape structure of the two problems.