After graduating from University I worked as research assistant to Dr. Ian Mitchell, working on the Traveling Salesman Problem (TSP).
The TSP is the problem of a salesman who wants to find, starting from his hometown, a shortest possible trip through a given set of customer cities and to return to his hometown. An original method was developed using message parsing together with a genetic algorithm. This was implemented as a Java applet for the web and a paper was co-authored.
