Why would they?
If you assume that your objective is kinda smooth genetic algorithms and related are guaranteed to suck. And most "real" world things of interest can be assumed to be pretty smooth
Your smoothness argument applies to the search approach. I would say "smooth" is not enough to describe the search space of real world solutions. I would rather call it fractal like. There are many smooth areas in a visualization of the Mandelbrot set. But the most interesting things happen in areas that are not smooth but follow some delicate logic. You find tiny local minima there that are hard to reach via gradient descent.
Genetic algorithms have a lot going for them in this type of search space. To pick one factor: GA's distribute the search power so that areas of the search space that are more promising get more resources. Similar to the optimal approach to deal with so called "multi-armed bandit" problems, GA's divide the search space in an optimal way, computation wise.
To achieve parity, GPs and GAs would need demonstrations on the level of what was seen about 10 years ago in NNs, then enough people would get involved to start doing more tech dev to make the hardware do GAs really, really, really fast.
With "genetic programming" I was referring to applying genetic algorithms to code. So that the result of the evolution is a program that performs well doing a task like driving a car.
Nice research on this has been done by John R. Koza. But nothing new came out in this area for quite a while.
I wouldn't be surprised if other approaches like genetic programming will make a comeback one day.
If there are any papers out there arguing for/against neural networks to stay in the king's seat forever, I would love to see them.