Iterated Local Search

When the user wants to design, implement, or tune iterated local search (ILS) — the local-search + perturbation + acceptance loop that is the strongest simple baseline for permutation and routing problems. Also use when the user mentions "iterated local search," "ILS," "perturbation," "kick move," "double-bridge," "iterated greedy," "restart strategy," or when a hill climber keeps returning the same local optimum and needs a principled escape mechanism. For neighborhood and delta-evaluation design, see local-search-and-neighborhoods; for randomized multi-start construction, see grasp.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit 536a68decf

Frequently asked questions

npx get-skill add hajibabaie/iterated-local-search