What is the main advantage of local search algorithms $($such as hill climbing, simulated annealing, genetic algorithms$)$ compared to BFS$/$DFS search algorithms?

What is the main advantage of local search algorithms $($such as hill climbing, simulated annealing, genetic algorithms$)$ compared to BFS$/$DFS search algorithms?

Always finds the optimal solution

Low space complexity

Always finds the optimal path to a s