EAs are effectively ML techniques. It's all a game of search.
The biggest problem I have seen with these algorithms is that they are wildly irrespective of the underlying hardware that they will inevitably run on top of. Koza, et. al., were effectively playing around in abstraction Narnia when you consider how impractical their designs were (are) to execute on hardware.
An L1-resident hill climber running on a single Zen4+ thread would absolutely smoke every single technique from the 90s combined, simply because it can explore so much more of the search space per unit time. A small tweak to this actually shows up on human timescales and so you can make meaningful iterations. Being made to wait days/weeks each time you want to see how your idea plays out will quickly curtail the space of ideas.
Please could you explain what you meant by this part? I'm trying and failing to understand it.
Would you be willing to try a fleeting idea if it took 2 days to test? How about if we could bring that down to 15 minutes?
I thought you were referring to some real world (I mean physical world) example of evolution finding efficiency in some manner.
Neural networks already take a long time to train so throwing out gradient descent entirely for tuning weights doesn't scale great.
Genetic programming can solve classic control problems with a few instructions when they can solve it, so that's cool.
There's a lot of problems where you're searching among many possibilities in a space that has lots of pieces in each solution. If you can encode the solution and fitness, a GA can give you an answer if you play with the knows enough. You also might not need to be an expert in that domain, like writing heuristics. If you know some, they might still help.
In EA if a candidate fails we throw it away. In RL we learn from that experience.
RL gets harder when rewards are really sparse. OpenAI developed evolution strategies which is a bit of a hybrid.
Meanwhile you have a whole separate discipline [1] for potential weaknesses on machine learning algorithms. Of course they may win when it comes to interdisciplinary ubiquity in CS, but any algorithm that relies on data assimilation and has little analytic formulation will suffer in robustness.
[1] https://en.wikipedia.org/wiki/Adversarial_machine_learning