Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/109196
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms |
Author: | Pourhassan, M. Gao, W. Neumann, F. |
Citation: | Proceedings of the 2015 Genetic and Evolutionary Computation Conference, 2015 / Silva, S. (ed./s), pp.903-910 |
Publisher: | Association for Computing Machinery |
Issue Date: | 2015 |
ISBN: | 9781450334723 |
Conference Name: | 2015 Genetic and Evolutionary Computation Conference (GECCO 2015) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain) |
Editor: | Silva, S. |
Statement of Responsibility: | Mojgan Pourhassan, Wanru Gao, Frank Neumann |
Abstract: | Evolutionary algorithms have been frequently used to deal with dynamic optimization problems, but their success is hard to understand from a theoretical perspective. With this paper, we contribute to the theoretical understanding of evolutionary algorithms for dynamic combinatorial optimization problems. We examine a dynamic version of the classical vertex cover problem and analyse evolutionary algorithms with respect to their ability to maintain a 2-approximation. Analysing the different evolutionary algorithms studied by Jansen et al. [7], we point out where two previously studied approaches are not able to maintain a 2-approximation even if they start with a solution of that quality. Furthermore, we point out that the third approach is very effective in maintaining 2-approximations for the dynamic vertex cover problem. |
Keywords: | Dynamic vertex cover problem, local search, (1+1) EA, combinatorial optimisation |
Rights: | © 2015 ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. |
DOI: | 10.1145/2739480.2754700 |
Grant ID: | http://purl.org/au-research/grants/arc/DP130104395 http://purl.org/au-research/grants/arc/DP140103400 |
Published version: | http://dx.doi.org/10.1145/2739480.2754700 |
Appears in Collections: | Aurora harvest 3 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_109196.pdf Restricted Access | Restricted Access | 1.63 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.