IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v39y2005i1p140-143.html
   My bibliography  Save this article

A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem

Author

Listed:
  • Bahram Alidaee

    (Hearin Center for Enterprise Science, School of Business, University of Mississippi, University, Mississippi 38677)

  • Gary A. Kochenberger

    (Business School, University of Colorado at Denver, Denver, Colorado 80217)

Abstract

The single-sink, fixed-charge transportation problem has a variety of applications, including supplier selection, product distribution/fleet selection, and process selection. In this paper we present a dynamic programming algorithm for solving this important problem that is very easy to implement and that improves considerably in terms of computational attractiveness on the best methods in the literature.

Suggested Citation

  • Bahram Alidaee & Gary A. Kochenberger, 2005. "A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem," Transportation Science, INFORMS, vol. 39(1), pages 140-143, February.
    • Handle: RePEc:inm:ortrsc:v:39:y:2005:i:1:p:140-143
    DOI: 10.1287/trsc.1030.0055
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1030.0055
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1030.0055?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. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.
    2. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    3. Francesca Maggioni & Florian A. Potra & Marida Bertocchi, 2017. "A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches," Computational Management Science, Springer, vol. 14(1), pages 5-44, January.
    4. Francesca Maggioni & Michal Kaut & Luca Bertazzi, 2009. "Stochastic optimization models for a single-sink transportation problem," Computational Management Science, Springer, vol. 6(2), pages 251-267, May.
    5. Mafakheri, Fereshteh & Breton, Michele & Ghoniem, Ahmed, 2011. "Supplier selection-order allocation: A two-stage multiple criteria dynamic programming approach," International Journal of Production Economics, Elsevier, vol. 132(1), pages 52-57, July.
    6. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    7. Mendoza, Abraham & Ventura, José A., 2010. "A serial inventory system with supplier selection and order quantity allocation," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1304-1315, December.

    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:ortrsc:v:39:y:2005:i:1:p:140-143. 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.