Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation

Y. T. Herer, M. J. Rosenblatt and I. Hefter
Additional contact information
Y. T. Herer: Faculty of Industrial Engineering and Management, Technion---Israel Institute of Technology, Haifa, Israel 32000
M. J. Rosenblatt: Faculty of Industrial Engineering and Management, Technion---Israel Institute of Technology, Haifa, Israel 32000 and John M. Olin School of Business, Washington University, St. Louis, MO 63130
I. Hefter: Faculty of Industrial Engineering and Management, Technion---Israel Institute of Technology, Haifa, Israel 32000

Transportation Science, 1996, vol. 30, issue 4, 276-290

Abstract: The single-sink fixed-charge transportation problem has many applications in the area of Manufacturing and Transportation---These include the supplier selection problem, the product distribution/fleet selection problem and the process selection problem. In this paper we investigate the single-sink fixed-charge transportation problem. We develop implicit enumeration procedures to solve this problem. These procedures include both domination rules and lower bounds. We also show how the domination rules can be integrated into the lower bounds so as to get even better lower bounds. We test our procedures against the best pre-existing procedure and thereby demonstrate that problems which were previously computationally intractable can now be easily solved.

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.4.276 (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:ortrsc:v:30:y:1996:i:4:p:276-290

Access Statistics for this article

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