Iterated Local Search
最优化与控制
2007-05-23 v1
摘要
This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems. It is based on building a sequence of (locally optimal) solutions by: (1) perturbing the current solution; (2) applying local search to that modified solution. At a high level, the method is simple, yet it allows for a detailed use of problem-specific properties. After giving a general framework, we cover the uses of Iterated Local Search on a number of well studied problems.
引用
@article{arxiv.math/0102188,
title = {Iterated Local Search},
author = {H. R. Lourenco and O. C. Martin and T. Stutzle},
journal= {arXiv preprint arXiv:math/0102188},
year = {2007}
}
备注
49 pages