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.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

Incoming links (8)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version