An Improved Starting Algorithm for the Ford-Fulkerson Approach to the Transportation Problem

Heiner Mueller-Merbach
Additional contact information
Heiner Mueller-Merbach: Institut für Praktische Mathematik, Technische Hochschule Darmstadt

Management Science, 1966, vol. 13, issue 1, 97-104

Abstract: This paper presents an algorithm for yielding an improved initial dual solution of the transportation problem when the network flow algorithm of Ford and Fulkerson is used. (1) The algorithm is described. (2) It is demonstrated by means of a numerical example. (3) Computational experience is reported. 400 medium-sized (30 \times 80; 50 \times 60; 50 \times 80) test problems with three different kinds of distance matrices and two different kinds of shipment quantity vectors were evaluated. The average improvement over the usual method was about 30%.

Date: 1966
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.1.97 (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:ormnsc:v:13:y:1966:i:1:p:97-104

Access Statistics for this article

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