You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of the West of England, Bristol » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of the West of England, Bristol

Return to search Previous output Next output

Output 35 of 55 in the submission

Article title

Memetic algorithms: The polynomial local search complexity theory perspective

Type

D - Journal article

DOI

10.1007/s10852-007-9070-9

Title of journal

Journal of Mathematical Modelling and Algorithms in Operations Research

Article number

Volume number

Issue number

First page of article

ISSN of journal

2214-2495

Year of publication

2008

URL

http://link.springer.com/article/10.1007%2Fs10852-007-9070-9

Number of additional authors

Additional information

<12> Design and analysis of algorithms. This paper proves the PLS completeness and worst case results for a class of hybrid meta-heuristic algorithms such as memetic algorithms on travelling salesman, maximal network flow and graph partitioning problems that complements Smith’s empirical research on Adaptive Memetic Algorithms.

Interdisciplinary

Cross-referral requested

Research group

3 - Artificial Intelligence Group

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract