The University of Southampton
University of Southampton Institutional Repository

On the landscape of combinatorial optimization problems

On the landscape of combinatorial optimization problems
On the landscape of combinatorial optimization problems
This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment. We have focused on two types of properties, local average properties of the landscape, and properties of the local optima. For the local optima we give a fairly comprehensive description of the properties, including the expected time to reach a local optimum, the number of local optima at different cost levels, the distance between optima, and the expected probability of reaching the optima. Principle component analysis is used to understand the correlations between the local optima. Most of the properties that we examine have not been studied previously, particularly those concerned with properties of the local optima. We compare and contrast the behavior of the four different problems. Although the problems are very different at the low level, many of the long-range properties exhibit a remarkable degree of similarity.
420-434
Tayarani Najaran, Mohammad
da003cbc-3d35-4aaa-aa8d-9437b720bfec
Prugel-Bennett, Adam
b107a151-1751-4d8b-b8db-2c395ac4e14e
Tayarani Najaran, Mohammad
da003cbc-3d35-4aaa-aa8d-9437b720bfec
Prugel-Bennett, Adam
b107a151-1751-4d8b-b8db-2c395ac4e14e

Tayarani Najaran, Mohammad and Prugel-Bennett, Adam (2013) On the landscape of combinatorial optimization problems. IEEE Transactions on Evolutionary Computation, 18 (3), 420-434. (doi:10.1109/TEVC.2013.2281502).

Record type: Article

Abstract

This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment. We have focused on two types of properties, local average properties of the landscape, and properties of the local optima. For the local optima we give a fairly comprehensive description of the properties, including the expected time to reach a local optimum, the number of local optima at different cost levels, the distance between optima, and the expected probability of reaching the optima. Principle component analysis is used to understand the correlations between the local optima. Most of the properties that we examine have not been studied previously, particularly those concerned with properties of the local optima. We compare and contrast the behavior of the four different problems. Although the problems are very different at the low level, many of the long-range properties exhibit a remarkable degree of similarity.

Text
__soton.ac.uk_UDE_PersonalFiles_Users_skr1c15_mydocuments_eprints_ECS_Prugel-Bennett_on the landscape of Combinatorial Optimisation Problems.pdf - Accepted Manuscript
Download (1MB)

More information

Accepted/In Press date: 25 July 2013
Published date: 11 September 2013
Organisations: Vision, Learning and Control

Identifiers

Local EPrints ID: 397016
URI: http://eprints.soton.ac.uk/id/eprint/397016
PURE UUID: 171a5c6d-88b8-4603-aa14-0544a417280d

Catalogue record

Date deposited: 12 Jul 2016 15:34
Last modified: 15 Mar 2024 01:04

Export record

Altmetrics

Contributors

Author: Mohammad Tayarani Najaran
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

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.

×