Routing Container Ships Using Lagrangean Relaxation and Decomposition

Krishan Rana and R. G. Vickson
Additional contact information
Krishan Rana: The University of Toledo, Toledo, Ohio 43606
R. G. Vickson: University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

Transportation Science, 1991, vol. 25, issue 3, 201-214

Abstract: International shipping is a multibillon dollar business and shipping companies may expect large benefits from improving the routing and scheduling processes of their ships. In this paper, we describe a container-ship routing scenario in which a shipping company provides services to a network of ports. We formulate a mathematical programming model that maximizes total profit (i.e., revenue minus operating costs) for multiple ships and determines: (a) the optimal sequence of ports of call for each ship, (b) the number of trips each ship makes in a planning horizon, and (c) the amount of cargo transported between any two ports by each ship. The model contains discrete, 0–1 and continuous variables, and nonlinear complicating constraints. The multiple container ship model is quite different from those of vehicle routing and traveling salesman problems. We use a decomposition method for the model as well as for the network in order to solve the problem. Several problems on 10- to 20-port networks are solved and the results presented.

Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (33)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.25.3.201 (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:25:y:1991:i:3:p:201-214

Access Statistics for this article

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