Next:
1 Creating graphs
Solving the Traveling Sales Man Problem
Branch & Bound, Deluge, Ants
Helge Janicke, Niels-Peter de Witt, Karsten Wolke
Date:
June 9, 2002
1 Creating graphs
1.1 Drawing graphs
1.1.1 Draw modes
1.1.2 Information on knots and edges
1.2 Distance matrix
2 Branch & Bound
2.1 Starting Branch & Bound
2.2 The Branch & Bound Algorithm
3 The Great Deluge (GD)
3.1 Getting started
3.2 Finding a new path
3.3 Decreasing the tyde
3.4 The end of the algorithm
4 Ant Algorithm
4.1 Transfer to computer science
4.2 Transfer to an Algorithm
4.2.1 How does the algorithm work
4.2.2 Choice of the way continuation with weighting parameters
4.2.3 Choice of the weighting parameters
