IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i6p1529-1538.html
   My bibliography  Save this article

Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

Author

Listed:
  • Paul Gray

    (Georgia Institute of Technology, Atlanta, Georgia)

Abstract

In the fixed-charge transportation problem, a fixed charge is associated with each route that can be opened, in addition to the variable transportation cost proportional to the amount of goods shipped- This note presents an exact solution of this mixed integer programming problem by decomposing it into a master integer program and a series of transportation subprograms. To reduce the number of vertices that need to be examined, bounds are established on the maximum and minimum values of the total fixed cost, and feasibility conditions for the transportation problem are used extensively. Computational results show the method to be particularly suitable when fixed costs are large compared to variable costs. A composite algorithm based on Murty's and the author's results is proposed.

Suggested Citation

  • Paul Gray, 1971. "Technical Note—Exact Solution of the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 19(6), pages 1529-1538, October.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:6:p:1529-1538
    DOI: 10.1287/opre.19.6.1529
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.6.1529
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.6.1529?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    2. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    3. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    4. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.

    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:inm:oropre:v:19:y:1971:i:6:p:1529-1538. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.