Rana, Krishan; Vickson, R. G. A model and solution algorithm for optimal routing of a time-chartered containership. (English) Zbl 0642.90053 Transp. Sci. 22, No. 2, 83-95 (1988). Summary: 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. Cited in 14 Documents MSC: 90B35 Deterministic scheduling theory in operations research 90C10 Integer programming 65K05 Numerical mathematical programming methods 90C27 Combinatorial optimization 90C39 Dynamic programming Keywords:optimal routing; container ship; integer network subprograms; Lagrangean Relaxation PDFBibTeX XMLCite \textit{K. Rana} and \textit{R. G. Vickson}, Transp. Sci. 22, No. 2, 83--95 (1988; Zbl 0642.90053) Full Text: DOI