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

The Tug Fleet Size Problem for Barge Line Operations: A Polynomial Algorithm

Author

Listed:
  • Ramchandran Jaikumar

    (Harvard University, Boston, Massachusetts)

  • Marius M. Solomon

    (Northeastern University, Boston, Massachusetts)

Abstract

In this paper the problem of minimizing the number of tugs required to transport a given number of barges between different ports in a river system is considered. The problem has traditionally been viewed as a vehicle routing problem and thus routing heuristics have been used. Advantage is taken of the feature that transfer time at ports is negligible, and the problem is modeled differently. A one-pass algorithm is developed which solves the problem in O ( n ) time. Extensions are made dealing with general river system structures and stochasticity in the demand pattern.

Suggested Citation

  • Ramchandran Jaikumar & Marius M. Solomon, 1987. "The Tug Fleet Size Problem for Barge Line Operations: A Polynomial Algorithm," Transportation Science, INFORMS, vol. 21(4), pages 264-272, November.
    • Handle: RePEc:inm:ortrsc:v:21:y:1987:i:4:p:264-272
    DOI: 10.1287/trsc.21.4.264
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.21.4.264
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.21.4.264?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. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    2. Vukadinovic, Katarina & Teodorovic, Dusan & Pavkovic, Goran, 1997. "A neural network approach to the vessel dispatching problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 473-487, November.
    3. Bakkehaug, Rikard & Eidem, Eirik Stamsø & Fagerholt, Kjetil & Hvattum, Lars Magnus, 2014. "A stochastic programming formulation for strategic fleet renewal in shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 60-76.
    4. Pantuso, Giovanni & Fagerholt, Kjetil & Hvattum, Lars Magnus, 2014. "A survey on maritime fleet size and mix problems," European Journal of Operational Research, Elsevier, vol. 235(2), pages 341-349.

    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:21:y:1987:i:4:p:264-272. 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.