IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v8y1961i3p257-276.html
   My bibliography  Save this article

A transportation algorithm and code

Author

Listed:
  • Merrill M. Flood

Abstract

A FORTRAN II transportation code, using Kuhn's Hungarian Method, was reported upon at the RAND Symposium on Mathematical Programming in March 1959. The algorithm was based upon a proof of the König‐Egervary theorem, presented by the present author at the 1958 Symposium on Combinatorial Problems sponsored by the American Mathematical Society. The code was entirely rewritten (in FORTRAN II), during the 1959 IBM Summer Institute on Combinatorial Problems, and several problems were run at the IBM Research Center to obtain data regarding computing times and frequencies of various internal loops. A CLOCK Subroutine yields readings, in hundredths of minutes, for each time through selected portions of the computing run. The version reported upon at RAND solved a 29 × 116 pseudorandom transportation problem in 8.01 min, as compared with 3.17 min using the fastest competing code (SHARE 464) then available. The present version solved this same problem in 2.87 min, and another 29 × 116 problem in 1.89 min. This paper presents the algorithm and reports upon computing experience.

Suggested Citation

  • Merrill M. Flood, 1961. "A transportation algorithm and code," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 8(3), pages 257-276, September.
    • Handle: RePEc:wly:navlog:v:8:y:1961:i:3:p:257-276
    DOI: 10.1002/nav.3800080308
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800080308
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800080308?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:8:y:1961:i:3:p:257-276. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.