Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
David Ronen (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: