One of the nice things about genetic algorithms is that they can easily be used for a diverse array of problem domains, whereas PSO for example seems best-suited for candidates of real-valued vectors (although I am aware of the use of the latter in combinatorial problems). It has, however, occurred to me that, by using genetic algorithms because they are familiar and easy to apply, I could be forgoing a better solution with a different metaheuristic. To avoid subjective discussion, I am of course looking for carefully gathered empirical results about this subject matter. I can't seem to find too many on my own.
Asked
Active
Viewed 69 times
2

Raphael
- 72,336
- 29
- 179
- 389

readyready15728
- 121
- 1
https://s3.amazonaws.com/academia.edu.documents/4623844/handbook_of_metaheuristics_2nd_edition.pdf?AWSAccessKeyId=AKIAIWOWYYGZ2Y53UL3A&Expires=1504534709&Signature=VMyG%2FHS4mfdd4SQOq73FMESQb2I%3D&response-content-disposition=inline%3B%20filename%3DArtificial_Immune_Systems.pdf#page=646
I find it a bit funny because loss of source code is mentioned as a problem which would not be an issue if the researchers used GitHub.
– readyready15728 Sep 04 '17 at 13:24