There are many algorithms currently available to approximate solutions to the ‘travelling salesman’ problem of finding the shortest route connecting n points in a complete tour. Conley (1988) presents a multi–stage simulation on a rank ordered distance array to solve a one vehicle problem forn = 20. A modification of that approach is presented here to deal with sending out two delivery trucks (or one truck making two trips) to touch allnpoints and return. An example forn = 33 is developed. The multi–stage simulation approach is then compared with other techniques.