Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm.
Abstract
A computer code for the transportation problem that is even more efficient than the primal-dual method is developed in this paper. The code uses the well-known (primal) MODI method and is developed by a benefit-cost investigation the possible strategies for finding an initial solution, choosing the pivot element, finding the stepping-stone tour, etc. A modified row-minimum start rule, the row most negative rule for choice of pivot and a modified form of the predecessor index method for locating stepping-stone tours were found to perform best among the strategies examined. Efficient methods are devised for the relabeling that is involved in moving from one solution to another. Mean computation times for solving 175 x 175 transportation problems on the UNIVAC 1108 is 2-14 seconds depending on the data configuration. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1970
- Accession Number
- AD0723197
Entities
People
- Gerald L. Thompson
- V. Srinivasan
Organizations
- Carnegie Mellon University