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.
Thomas Stützle homepage 2026-11-05