Algoriti ya Kimemeti
Algoriti ya Kimemeti (MA) ni metaheuristiki inayotegemea kundi la suluhu inayochanganya uchunguzi wa kimataifa wa algoriti ya mageuzi na uchunguzi wa ndani wa taratibu za kujifunza binafsi. Imeanzishwa na Pablo Moscato mwaka 1989 katika Caltech, MA hutumia dhana ya Richard Dawkins ya meme - kitengo cha uhamishaji wa kitamaduni - kuunda wazo kwamba suluhu zinaweza kuboreshwa sio tu kupitia msalaba na mabadiliko bali pia kupitia uboreshaji binafsi ndani ya kila kizazi.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program Report 826. link ↗
- Neri, F., & Cotta, C. (2012). Memetic algorithms and memetic computing optimization: A literature review. Swarm and Evolutionary Computation, 2, 1–14. DOI: 10.1016/j.swevo.2011.11.003 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Memetic Algorithms (Hybrid Evolutionary + Local Search). ScholarGate. https://scholargate.app/sw/optimization/memetic-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Algorithimu ya KijenetikiUboreshaji↔ compare
- Hyper-heuristicsUboreshaji↔ compare
- Utafutaji TabuUboreshaji↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →