This paper describes an exact algorithm for the asymmetrical multiple travelling salesman problem. The problem is solved by branch and bound and a flow circulation algorithm is used for the solution of the subproblems. Results for problems containing up to 160 points are presented.