Decision Space Differential Evolution Local Search Memetic Algorithm Particle Swarm Optimization
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”.
Metrics
9 Record Views
Details
Title
Memetic Algorithms in Continuous Optimization
Creators
Carlos Cotta - UNIVERSIDAD DE MÁLAGA
Ferrante Neri - University of Jyväskylä
Publication Details
Handbook of Memetic Algorithms, pp.121-134
Series
Studies in Computational Intelligence
Publisher
Springer Berlin Heidelberg; Berlin, Heidelberg
Date published
2012
Identifiers
99783225902346
Academic Unit
School of Computer Science and Electronic Engineering
Language
English
Resource Type
Book chapter
Usage Policy
Usage details for all content viewed and downloaded in this site are shared with IRUS-UK (Institutional Repository Usage Statistics UK). Cookies are used to remember your decision. Click Accept to accept usage details sharing and the cookies.