Department of Mathematics
Department of Computer Science
Iowa State University
Course Information
|
Lecture Time: MWF 9:00-9:50am Room: 1071 Black Eng. |
Office Hours Office: 416 Carver Time: M 10:00-10:50am T 12:00-1:00pm |
| Syllabus |
TSP Heuristic Animations
Homework 5 Problem 4
A nearest-neighbor heuristic.
After 2opt switches.
The animated process.
Homework 5 Problem 5
A nearest-neighbor heuristic. (It is 2opt locally optimal.)
The animated process.
TSP Example 1
The problem instance.
A nearest-neighbor heuristic.
After 2opt switches.
The animated process.
TSP Example 2
The problem instance.
A nearest-neighbor heuristic.
After 2opt switches.
After Lin-Kernighan.
The animated process.
More Animated Instances
