A NEW OPTIMIZATION METHOD FOR LARGE-SCALE FIXED CHARGE TRANSPORTATION PROBLEMS

This paper presents a branch-and-bound algorithm for solving fixed charge transportation problems where not all cells exist. The algorithm exploits the absence of full problem density in several ways, thus yielding a procedure which is especially applicable to solving real-world problems which are normally quite sparse. Additionally, streamlined new procedures for pruning the decision tree and calculating penalties are presented. We present computational experience with both a set of large test problems and a set of dense test problems from the literature. Comparisons with other codes are uniformly favorable to the new method, which runs more than twice as fast as the best alternative. (Author)

  • Corporate Authors:

    University of Texas, Austin

    Center for Cybernetic Studies
    Austin, TX  USA  78712
  • Authors:
    • Barr, R S
    • Glover, F W
    • KLINGMAN, D D
  • Publication Date: 1979-3

Media Info

  • Pagination: 44 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00198358
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Report/Paper Numbers: CCS-350
  • Contract Numbers: N00014-75-C-0616, N00014-75-C-0569
  • Files: TRIS
  • Created Date: Oct 17 1980 12:00AM