A Statistical Approach to the TSP

This paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the combinatorially intractable TSP is presented, from which statistical estimates of the optimal tour length can be derived. Assumptions, along with computational experience and conclusions are discussed.Supported in part by the U.S. Department of Transportation under contract DOT-TSC-1058, Transportation Advanced Research Program (TARP)

Shortest Path Algorithms: A Comparison

In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks

Modeling and Optimization for Transportation Systems Planning and Operations

In this paper, we focus on a number of applications of network optimization techniques to transportation systems analysis. In particular, network analysis problems, network design problems, and network management problems are discussed in some detail. The intent is to survey important application areas.*To be presented at the International Symposium on Large Engineering Systems, University of Manitoba, Winnipeg, Manitoba, Canada, August 9-12, 197