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

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Y. T. Herer & M. J. Rosenblatt & I. Hefter, 1996. "Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation," Transportation Science, INFORMS, vol. 30(4), pages 276-290, November.
    • Handle: RePEc:inm:ortrsc:v:30:y:1996:i:4:p:276-290
    DOI: 10.1287/trsc.30.4.276
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.30.4.276
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.30.4.276?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. 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.
    2. 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.
    3. 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.
    4. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.
    6. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    7. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    8. Qi, Xiangtong, 2007. "Order splitting with multiple capacitated suppliers," European Journal of Operational Research, Elsevier, vol. 178(2), pages 421-432, April.
    9. 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.
    10. Meir J. Rosenblatt & Yale T. Herer & Ilan Hefter, 1998. "Note. An Acquisition Policy for a Single Item Multi-Supplier System," Management Science, INFORMS, vol. 44(11-Part-2), pages 96-100, 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:ortrsc:v:30:y:1996:i:4:p:276-290. 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.