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

Ramchandran Jaikumar and Marius M. Solomon
Additional contact information
Ramchandran Jaikumar: Harvard University, Boston, Massachusetts
Marius M. Solomon: Northeastern University, Boston, Massachusetts

Transportation Science, 1987, vol. 21, issue 4, 264-272

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.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.21.4.264 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:21:y:1987:i:4:p:264-272

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().