The University of Southampton
University of Southampton Institutional Repository

Clustering solutions: a novel approach to solving NP-complete problems

Record type: Thesis (Doctoral)

In this thesis, we introduce a novel approach to solving MAX-SAT problems. This algorithm clusters good solutions, and restarts the search from the closest feasible configuration to the centroid of each cluster. We call this method Clustered-Landscape Guided Hopping (CLGH). In addition, where clustering does not provide an advantage due to the non-clustered landscape configuration, we use Averaged-Landscape Guided Hopping (ALGH). CLGH is shown to be highly efficient for finding good solutions of large MAX-SAT problems. Systematic studies of the landscape are presented to show that the success of clustering is due to the learning of large-scale structure of the fitness landscape. Previous studies conducted by other researchers analysed the relationship between local and global minima and provided an insight into the configuration of the landscape. It was found that local minima formed clusters around global ones. We expanded these analyses to cover the relationship between clusters, and found that local minima form many correlated yet distant clusters. In addition, we show the existence of a relationship between the size of the problem and the distance between local minima. To rule out other possibilities of this success we test several other population based algorithms, and compare their performances to clustering. In addition, we compare with solo-search algorithms. We show that this method is superior to all algorithms tested. CLGH produces results that might be produced by a solo-local search algorithm within 95% less time. However, this is not a standalone technique, and can be incorporated within other algorithms to further enhance their performance. A further application of clustering is carried out on the Traveling Salesman Problem (TSP) in the discrete domain, and Artificial Neural Networks (ANN) using backpropagation for the purpose of data classification in the continuous domain. Since TSP does not show a clustered landscape configuration we find that ALGH is an effective method for improving search results. Preliminary results are shown indicating that extensions of the proposed algorithm can give similar improvements on these hard optimisation problems.

PDF thesis.pdf - Other
Download (2MB)

Citation

Qasem, Mohamed (2010) Clustering solutions: a novel approach to solving NP-complete problems University of Southampton, School of Electronics and Computer Science, Doctoral Thesis , 128pp.

More information

Published date: June 2010
Keywords: satisfiability, max-sat, sat, clustering, novel, np-complete, k-means, tsp, ann
Organisations: University of Southampton, Electronics & Computer Science

Identifiers

Local EPrints ID: 271282
URI: http://eprints.soton.ac.uk/id/eprint/271282
PURE UUID: adfebe29-8a26-49f1-abc4-285a5bf5306e

Catalogue record

Date deposited: 22 Jun 2010 08:48
Last modified: 18 Jul 2017 06:44

Export record

Contributors

Author: Mohamed Qasem
Thesis advisor: Adam Prugel-Bennett

University divisions


Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×