= Iterated Local Search by Helena R. Lourenço and others
{c}
{tag=Work by Helena Ramalhinho Dias Lourenço}
{tag=Work by Olivier C. Martin}
{tag=Work by Thomas Stützle}
{title2=2001}
https://arxiv.org/abs/math/0102188
https://arxiv.org/pdf/math/0102188
Author manuscript dated 23 February 2001, with bylines <Helena R. Lourenço>, <Olivier C. Martin> and <Thomas Stützle>. Sections 2–3 describe the modular <iterated local search> framework. Section 3.3 and Table 3 compare acceptance rules and random restarts for the <travelling salesman problem>; Table 3 specifies ten runs and 120 seconds on a Pentium 266 MHz PC.
Back to article page
