IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v25y1991i3p201-214.html
   My bibliography  Save this article

Routing Container Ships Using Lagrangean Relaxation and Decomposition

Author

Listed:
  • Krishan Rana

    (The University of Toledo, Toledo, Ohio 43606)

  • R. G. Vickson

    (University of Waterloo, Waterloo, Ontario, Canada N2L 3G1)

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.

Suggested Citation

  • Krishan Rana & R. G. Vickson, 1991. "Routing Container Ships Using Lagrangean Relaxation and Decomposition," Transportation Science, INFORMS, vol. 25(3), pages 201-214, August.
    • Handle: RePEc:inm:ortrsc:v:25:y:1991:i:3:p:201-214
    DOI: 10.1287/trsc.25.3.201
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.25.3.201
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.25.3.201?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:25:y:1991:i:3:p:201-214. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.