IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v198y2025ics1366554525000602.html
   My bibliography  Save this article

A rich model for the tramp ship routing and scheduling problem—Solved through column generation

Author

Listed:
  • Tamburini, Alberto
  • Lange, Nina
  • Pisinger, David

Abstract

We consider the Tramp Ship Routing and Scheduling Problem (TSRSP) in which we plan routes for a fleet of tramp shipping vessels operating on a combined contract and spot market. Earlier research has been fragmented due to variations in the side constraints studied. Hence we present the first unified model that can handle speed optimization, chartering costs, bunker planning, and hull cleaning. The model is solved by column generation, where the columns represent the possible routes of a vessel, while the master problem keeps track of the binding constraints. The pricing problem is solved efficiently using a time–space graph and several dominance rules. Real-life instances with up to 40 vessels, 35 geographic regions, and four months planning horizon can be solved to optimality in less than half an hour. The optimized routes increase earnings by 7% compared to historical schedules. Furthermore, policy-makers can use the model as a simulation of a rational agent behavior.

Suggested Citation

  • Tamburini, Alberto & Lange, Nina & Pisinger, David, 2025. "A rich model for the tramp ship routing and scheduling problem—Solved through column generation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 198(C).
    • Handle: RePEc:eee:transe:v:198:y:2025:i:c:s1366554525000602
    DOI: 10.1016/j.tre.2025.104019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525000602
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104019?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:transe:v:198:y:2025:i:c:s1366554525000602. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.