When simpler searches cannot reach a needed improvement, evolutionary archive search breeds candidates from an archive of previously found good variants—not just the latest population. That deeper pool can reach further, but maintaining and evaluating it costs substantially more compute. section 1.4.2
Figure 1.11 The search family arranged by cost against improvement reach. Hill-climbing is the cheapest and most limited, pairwise and population methods cost more and reach further, reinforcement-learning searches fit policy-shaped artifacts, and evolutionary archive search is the most expensive and reaches the furthest. Meta-search sits apart, since it changes the search itself rather than spending more effort on the same curve.

Compare search methods by cost and improvement reach: archive search reaches furthest at the highest cost, while meta-search changes the search itself. section 1.4.2
