Output details
11 - Computer Science and Informatics
Aberystwyth University
Article title
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
Type
D - Journal article
Title of journal
Evolutionary Computation
Article number
-
Volume number
18
Issue number
4
First page of article
617
ISSN of journal
1063-6560
Year of publication
2010
URL
-
Number of additional authors
4
Additional information
<22> IF=2.109. Evolutionary Computation is a leading (and oldest) journal in the relevant area. It is the first work to show for a combinatorial optimisation problem, a multi-objective evolutionary algorithm can be more efficient than a single-objective one in terms of the approximation quality. The approach has been taken up by many leading researchers in the area to analyse multi-objective evolutionary algorithms (e.g. at Max-Planck-Institut Fur Informatik and Universitat des Saarlandes, Germany; Nanjina University, China; and University of Birmingham, UK).
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
12
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
