Evaluation of parallel metaheuristics

作者: Gabriel Luque , Enrique Alba

DOI:

关键词:

摘要: When evaluating algorithms a very important goal is to perform better than the state-of-the-art techniques.. This requires experimental tests compare new algorithm with respect rest. It is, in general, hard make fair comparisons between such as metaheuristics. The reason that we can infer di erent conclusions from same results depending on metrics use and how they are applied. specially for non-deterministic methods. analysis becomes more complex if study includes parallel metaheuristics, since many researchers not aware of existing their meanings, especially concerning vast literature programming used well before metaheuristics were rst introduced. In this paper, focus evaluation algorithms. We give clear de nition main performance illustrate be used.

参考文章(7)
Reiko Tanese, Distributed Genetic Algorithms international conference on genetic algorithms. pp. 434- 439 ,(1989)
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by Simulated Annealing Science. ,vol. 220, pp. 671- 680 ,(1983) , 10.1126/SCIENCE.220.4598.671
Alan H. Karp, Horace P. Flatt, Measuring parallel processor performance Communications of the ACM. ,vol. 33, pp. 539- 543 ,(1990) , 10.1145/78607.78614
Enrique Alba, Parallel evolutionary algorithms can achieve super-linear performance Information Processing Letters. ,vol. 82, pp. 7- 13 ,(2002) , 10.1016/S0020-0190(01)00281-2
David E. Goldberg, Genetic algorithms in search, optimization and machine learning Reading: Addison-Wesley. ,(1989)