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
2009
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.
Text
paper.pdf
- Version of Record
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: http://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: 14 Mar 2024 09:03
Export record
Contributors
Author:
Mohamed Qasem
Author:
Adam Prugel-Bennett
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