The University of Southampton
University of Southampton Institutional Repository

Improving Performance in Combinatorial Optimisation Using Averaging and Clustering

Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
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.
Qasem, Mohamed
e7828af0-2b26-4142-85a6-1e92298af47c
Prugel-Bennett, Adam
b107a151-1751-4d8b-b8db-2c395ac4e14e
Qasem, Mohamed
e7828af0-2b26-4142-85a6-1e92298af47c
Prugel-Bennett, Adam
b107a151-1751-4d8b-b8db-2c395ac4e14e

Qasem, Mohamed and Prugel-Bennett, Adam (2009) Improving Performance in Combinatorial Optimisation Using Averaging and Clustering. EvoCOP'09.

Record type: Conference or Workshop Item (Paper)

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.

PDF
paper.pdf - Version of Record
Download (272kB)

More information

Published date: 2009
Additional Information: Event Dates: 2009
Venue - Dates: EvoCOP'09, 2009-01-01
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 268061
URI: https://eprints.soton.ac.uk/id/eprint/268061
PURE UUID: 42b89f2f-843b-441a-bf1f-766f67c8bfa8

Catalogue record

Date deposited: 19 Oct 2009 08:45
Last modified: 18 Jul 2017 06:57

Export record

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 https://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.

×