About: Memetic algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Memetic algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatEvolutionaryAlgorithms, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMemetic_algorithm

A memetic algorithm (MA) in computer science and operations research, is an extension of the traditional genetic algorithm. It may provide a sufficiently good solution to an optimization problem. It uses a local search technique to reduce the likelihood of premature convergence.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:WikicatEvolutionaryAlgorithms
rdfs:label	Memetischer Algorithmus (de) Algoritmo memético (es) Algorithme mémétique (fr) 미미틱 알고리즘 (ko) Memetic algorithm (en)
rdfs:comment	Los algoritmos meméticos son técnicas de optimización que combinan sinérgicamente conceptos tomados de otras metaheurísticas, tales como la búsqueda basada en poblaciones (como en los algoritmos evolutivos), y la mejora local (como en las técnicas de seguimiento del gradiente). (es) Memetische Algorithmen (MA) sind eine Erweiterung von global suchenden populationsbasierten Metaheuristiken um Verfahren zur lokalen Suche, des maschinellen Lernens oder anderer Verbesserungs- oder Optimierungsverfahren. Typische Vertreter erweitern einen Evolutionären Algorithmus (EA) als global suchendes Verfahren um ein oder mehrere lokale Suchverfahren oder Heuristiken, die als Mem bezeichnet werden. Sie können problemspezifisch sein, müssen es aber nicht. (de) A memetic algorithm (MA) in computer science and operations research, is an extension of the traditional genetic algorithm. It may provide a sufficiently good solution to an optimization problem. It uses a local search technique to reduce the likelihood of premature convergence. (en) Les algorithmes mémétiques appartiennent à la famille des algorithmes évolutionnistes. Leur but est d'obtenir une solution approchée à un problème d'optimisation, lorsqu'il n'existe pas de méthode de résolution pour résoudre le problème de manière exacte en un temps raisonnable. Les algorithmes mémétiques sont nés d'une hybridation entre les algorithmes génétiques et les algorithmes de recherche locale. Ils utilisent le même processus de résolution que les algorithmes génétiques mais utilisent un opérateur de recherche locale après celui de mutation. L'intérêt de cette classe d'algorithme est l'apport de la diversification de la partie génétique accompagnée par l'intensification de la recherche locale. (fr) 미미틱 알고리즘(memetic algorithm)은 혼합형 유전 알고리즘의 대표적인 형태이다.리처드 도킨스의 저서 이기적 유전자에서 처음 사용된 "밈(meme)"에서 유래되었다.최적해를 구하기 위해서 일반적인 유전 알고리즘과 지역 최적화 알고리즘을 함께 이용하는데, 유전 알고리즘의 교차와 변이에 의해서 지역 최적점 근처에 있게 된 해를 기법을 통해 지역 최적점에 가까이 가도록 미세 조정을 하는 방법이다. 유전 알고리즘은 탐색 능력이 뛰어나 지역 최적점 근처의 해를 얻을 수는 있지만, 이러한 근사해를 미세하게 조정해서 정확한 지역 최적해를 얻는 능력은 부족하기 때문에 이를 보완하기 위해 지역 탐색 기법을 사용한다. 일반적으로 미미틱 알고리즘은 지역 최적화와 결합하지 않은 유전 알고리즘에 비해 빠른 시간에 적합도가 더욱 높은 해를 찾아낸다. 미미틱 알고리즘은 주로 혼합형 유전 알고리즘과 같은 뜻으로 쓰이고 있으나, 유전 알고리즘 이외의 진화 연산 기법과 지역 탐색 기법을 결합하는 경우에는 미미틱 알고리즘이라고 부르는 것이 적절하다. 미미틱 알고리즘에 대비하여, 지역 탐색 기법과 결합하지 않은 원래의 유전 알고리즘을 순수 유전 알고리즘이라고 부른다. (ko)
dcterms:subject	Evolutionary algorithms
Wikipage page ID	3989208 (xsd:integer)
Wikipage revision ID	1100820025 (xsd:integer)
Link from a Wikipage to another Wikipage	Meme NP (complexity) Nurse rostering problem Algorithm Richard Dawkins Charged particle beam VLSI Universal Darwinism Conjugate gradient method Genotype Interior point method Circuit design Genetic algorithm Graph coloring NHL Cluster analysis Combinatorial optimization Computer science Feature selection Pattern recognition Travelling salesman problem Data science Local search (optimization) Dual-phase evolution Chromosome Graph partition Hill climbing Quadratic assignment problem Hyper-heuristic Artificial neural network Bin packing problem Heuristic Evolutionary algorithms Business analytics Independent set problem Operations research Optimization problem Knapsack problem Generalized Assignment Problem Set cover problem Schedule (workplace) Expert system Evolutionary algorithm Evolutionary computation Motion planning Premature convergence Single machine scheduling Expression profiling dbr:Pablo_Moscato dbr:Processor_allocation
Link from a Wikipage to an external page	https://web.archive.org/web/20100306001555/http:/cec2007.nus.edu.sg/ http://www.wcci2008.org/ http://www.mitpressjournals.org/doi/abs/10.1162/1063656041775009%3FprevSearch=allfield%3A%28memetic+algorithm%29 http://www.ntu.edu.sg/home/asysong/ETTC/ETTC%20Task%20Force%20-%20Memetic%20Computing.htm http://www.ntu.edu.sg/home/asysong/SC/Special-Issue-MA.htm http://www.springeronline.com/sgw/cda/frontpage/0,11855,5-40356-72-34233226-0,00.html http://users.jyu.fi/~neferran/MA2008/MA2008.htm http://www.esi-topics.com/erf/2007/august07-Ong_Keane.html https://ieeexplore.ieee.org/document/4067075 https://web.archive.org/web/20080216234225/http:/ntu-cg.ntu.edu.sg/ysong/MA-SS/MA.htm https://www.springer.com/journal/12293
sameAs	Memetic algorithm Memetic algorithm Memetic algorithm Memetic algorithm Memetic algorithm Memetic algorithm Memetic algorithm Memetic algorithm Memetic algorithm
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cleanup_section dbt:ISBN dbt:Reflist dbt:Evolutionary_algorithms
date	June 2022 (en)
reason	Section headers should not be phrased as questions (en)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software