Master of Science
John M. Carroll
The Truck Dispatching Problem is a special form of the well known Traveling Salesman Problem. No analytical solution that will guarantee an optimal solution to this problem is known to exist. This thesis solves the Truck Dispatching Problem by a Branch and Bound technique.
Brokke, Harris M., "A branch and bound algorithm for solving the truck dispatching problem" (1968). Theses and Dissertations. 3682.