Discrete Programs for Moving Known Cargos from Origins to Destinations on Time at Minimum Bargeline Fleet Cost

N. L. Schwartz
Additional contact information
N. L. Schwartz: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Transportation Science, 1968, vol. 2, issue 2, 134-145

Abstract: A bargeline which accepts various cargos for timely delivery between pairs of ports in its district must determine the routing and timing of movements of barges and towboats to execute the agreed freight movements at minimum fleet cost. A linear discrete programming model of this optimization problem is developed. The cargo movements to be made and the times needed for transit, loading, and unloading are assumed known. A solution of the model gives the numbers of barges and towboats of each size required to provide the service, with the consequent minimal cost. It also provides a complete schedule for the bargeline, specifying the location and status of the barges, boats, and freight at every time unit of the scheduling period.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2.2.134 (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:2:y:1968:i:2:p:134-145

Access Statistics for this article

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