Short-Term Scheduling of Vessels for Shipping Bulk or Semi-Bulk Commodities Originating in a Single Area

David Ronen
Additional contact information
David Ronen: University of Missouri, St. Louis, Missouri

Operations Research, 1986, vol. 34, issue 1, 164-173

Abstract: We analyze a single-voyage ship-scheduling problem. A set of ships of different sizes and cost functions must be used to deliver a set of shipments to their destinations. The cost function that is minimized consists of the cost of ships' time and port charges, as this cost applies to the various terms of ships employment. We compare several algorithms for allocating shipments to ships, and achieve substantial cost savings as compared with industry practice. A biased random algorithm provides very good solutions that are close to the optimal ones.

Keywords: 632 heuristic algorithms for integer problems; 839 short term ship scheduling (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.1.164 (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:oropre:v:34:y:1986:i:1:p:164-173

Access Statistics for this article

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