Local Search And Neighborhoods

When the user wants to design or implement neighborhood-based local search - choosing moves (swap, insertion, 2-opt, Or-opt, exchange), writing O(1)/O(n) delta evaluation, first vs best improvement, scan order, and move data structures. Also use when the user mentions "local search," "2-opt," "neighborhood," "delta evaluation," "hill climbing," "first improvement," or when a heuristic recomputes the full objective after every move. For accepting worsening moves to escape local optima, see simulated-annealing; for perturbation-and-restart wrappers, see iterated-local-search.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit c81bf5c71b

Frequently asked questions

npx get-skill add hajibabaie/local-search-and-neighborhoods