Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Memetisk Algoritme× | Tabu Search× | |
|---|---|---|
| Fagområde | Optimering | Optimering |
| Familie | Process / pipeline | Process / pipeline |
| Oprindelsesår | 1989 | 1989 |
| Ophavsperson≠ | Pablo Moscato | Fred Glover |
| Type≠ | Hybrid metaheuristic | Local-search metaheuristic |
| Oprindelig kilde≠ | Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program Report 826. link ↗ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Aliasser≠ | Hybrid Evolutionary Algorithm, Cultural Algorithm (local-search variant), Genetic Local Search, Memetik Algoritma | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Relaterede≠ | 3 | 4 |
| Resumé≠ | A Memetic Algorithm (MA) is a population-based metaheuristic that combines the global exploration of an evolutionary algorithm with the local exploitation of individual learning procedures. Introduced by Pablo Moscato in 1989 at Caltech, MAs draw on Richard Dawkins' concept of the meme — a unit of cultural transmission — to model the idea that solutions can improve not only through crossover and mutation but also through individual refinement within each generation. | Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems. |
| ScholarGateDatasæt ↗ |
|
|