|
|
Traveling Agent
Traveling Agent (TA) was created as a final project for "User Interface Design using MFC" course in CSU Chico.
This project deals with the Traveling Agent problem, which is about computing the shortest path between cities. The number of possible paths is expending exponentially as the number of cities to visit grows bigger. |
The program enhances branch and bound algorithm in order to produce the optimal/shortest path in the shortest time.Traveling Agent application enhances multithread technology. All searches are running under a separate path of execution than the main application. Download TAgent, includeing source-code. More information in the readme.txt file found in the package. |
 |
 |
| Discover Israel |
| CSU Chico |
|
|
