Are long path problems hard for genetic algorithms?

Excerpt

<div><b>Genetic algorithms</b> (GAs) can be considered as fairly robust search algorithms that work with few assumptions made about the problem to be solved. This advantage clearly has costs and GAs usually require longer execution times than those algorithms that are specialized for a given problem.</div>