We study the scalability and efficiency of a GA that we developed earlier to solve the practical cartographic problem of labeling a map with point features. We argue that the special characteristics of our GA make that it fits in well with theoretical models predicting the optimal population size (the Gambler’s Ruin model) and the number of generations until convergence. We then verify these predictions experimentally. It turns out that our algorithm indeed performs according to the theory, leading to a scale-up for the total amount of computational effort that is linear in the problem size.
|Title of host publication||Parallel Problem Solving from Nature (Proceedings 6th International Conference, PPSN-VI, Paris, France, September 18-20, 2000)|
|Place of Publication||Berlin|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|