A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership

Krishan Rana and R. G. Vickson
Additional contact information
Krishan Rana: Saint Mary's University, Halifax, Nova Scotia, Canada
R. G. Vickson: University of Waterloo, Waterloo, Ontario, Canada

Transportation Science, 1988, vol. 22, issue 2, 83-95

Abstract: We formulate a mathematical programming model for optimally routing a chartered container ship. Our model helps in evaluating whether a container ship should be chartered or not. The model calculates the optimal sequence of port calls, the number of containers transported between port pairs, and the number of trips the ship makes in the chartered period. A specialized algorithm is developed to solve the integer network subprograms which determine the sequence of port calls. Our algorithm, which solves an integer program optimally, is quite efficient. Comparison of computational results with a Lagrangean Relaxation method and an embedded dynamic program are also presented.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.2.83 (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:22:y:1988:i:2:p:83-95

Access Statistics for this article

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