Graphical Display

The progress of the (genetic) algorithm can be observed in the drawing of the graph (cf. Figure 4). The colors of the edge have the following meaning:

Green

The corresponding edge does not belong to any path.

Red

The corresponding edge belongs to the optimal solution found by the Dijkstra algorithm.

Blue

The corresponding edge belongs to the best solution found by the genetic algorithm so fare.

Cyan

The corresponding edge belongs to the first child of the current generation of the genetic algorithm.

Yellow

The corresponding edge belongs to the second child of the current generation of the genetic algorithm.

If a line is dashed this means that several paths go over this edge. If the dashes of one color are longer than those of another color, a path goes several times over this edge.

Figure 4: Graphical display.