A New Optimization Method for Large Scale Fixed Charge Transportation Problems

Richard S. Barr, Fred Glover and Darwin Klingman
Additional contact information
Richard S. Barr: Southern Methodist University, Dallas, Texas
Fred Glover: University of Colorado, Boulder, Colorado
Darwin Klingman: University of Texas at Austin, Austin, Texas

Operations Research, 1981, vol. 29, issue 3, 448-463

Abstract: 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.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.3.448 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:3:p:448-463

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().