Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
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.
Unable to display preview. Download preview PDF.
- 1.Qasem, M., Prügel-Bennett, A.: Learning the large-scale structure of the max-sat landscape using populations. IEEE Transactions on Evolutionary Computation (2008) (submitted)Google Scholar
- 2.Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, CA, USA, pp. 459–465. AAAI, Menlo Park (1992)Google Scholar
- 7.Qasem, M., Prügel-Bennett, A.: Complexity of max-sat using stochastic algorithms. In: GECCO (2008)Google Scholar
- 8.Hartigan, J.A., Wong, M.A.: A k-means clustering algorithm. Applied Statistics 28(1), 100–108 (1979)Google Scholar