Comparing genetic algorithms and greedy heuristics for adaptationproblems

摘要

The framework of evolutionary algorithms has proven to be quitesuccessful in designing hybrid search algorithms. The quality ofsolutions achieved by such hybrid search engines is usually much betterthan the quality of solutions provided by any of the participatingindividual heuristics, but the price paid is slower computational speed.For problems where computational speed is crucial it is interesting toinvestigate the trade-off between the quality of solution and the timeto reach it. This paper investigates one such problem, namely theadaptation of a distributed file system