A computerized simulation approach to the solution of the carrier dispatching problem

The purpose of this research is to study the feasibility of determining a solution to the large scale carrier dispatching problem utilizing the tool of computerized simulation and to develop statistical confidence intervals for the shortest resulting route. A Fortran program was compiled, utilizing a computerized algorithm for solving the now famous 'Traveling Salesman' problem, in conjunction with a random ordering of a series of 'demand points'. The computer program, assembled for an IBM 1410 computer was used in solving several problems with low routes previously suggested to be optimum by various algorithms. Experience with the sample problems indicates a decrease in efficiency over time of finding a near optimal route with an increasing number of demand points. Although an optimal solution is not apt to be determined, a route is always determined, which is an advantage over some of the algorithms which require an approximation after the solution is obtained.