The 3 scenarios were compared. Implemented in C using the CSIM simulator. The paths have weights associated with them. Goal is to maximize the flow of the network using a technique described in the paper that uses dynamic trees. This paper describes an approximation technique to solve the TSP problem.
Basic technique is to use something like divide and conquer to solve the problem.
The paper describes the technique in detail. Artificial Intelligence Projects, Implemented various Search Techniques in Lisp, a Knowledge Base in Prolog, Solved Partial Order Planning Problems in Prolog.