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

    for a different version of it.

    References listed on IDEAS

    as
    1. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    2. Marshall L. Fisher & Moshe B. Rosenwein, 1989. "An interactive optimization system for bulk‐cargo ship scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 27-42, February.
    3. Leif H. Appelgren, 1969. "A Column Generation Algorithm for a Ship Scheduling Problem," Transportation Science, INFORMS, vol. 3(1), pages 53-68, February.
    4. Wu, Lingxiao & Wang, Shuaian & Laporte, Gilbert, 2021. "The Robust Bulk Ship Routing Problem with Batched Cargo Selection," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 124-159.
    5. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    6. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.
    7. Dan O. Bausch & Gerald G. Brown & David Ronen, 1998. "Scheduling short-term marine transport of bulk products," Maritime Policy & Management, Taylor & Francis Journals, vol. 25(4), pages 335-348, October.
    8. Leif H. Appelgren, 1971. "Integer Programming Methods for a Vessel Scheduling Problem," Transportation Science, INFORMS, vol. 5(1), pages 64-78, February.
    9. Homsi, Gabriel & Martinelli, Rafael & Vidal, Thibaut & Fagerholt, Kjetil, 2020. "Industrial and tramp ship routing problems: Closing the gap for real-scale instances," European Journal of Operational Research, Elsevier, vol. 283(3), pages 972-990.
    10. Charlotte Vilhelmsen & Richard M. Lusby & Jesper Larsen, 2017. "Tramp ship routing and scheduling with voyage separation requirements," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 913-943, October.
    11. Kjetil Fagerholt & Haakon Lindstad, 2007. "TurboRouter: An Interactive Optimisation-Based Decision Support System for Ship Routing and Scheduling," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 9(3), pages 214-233, September.
    12. Jing-Quan Li, 2014. "Transit Bus Scheduling with Limited Energy," Transportation Science, INFORMS, vol. 48(4), pages 521-539, November.
    13. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    14. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    15. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    16. Christian Edinger Munk Plum & Peter Neergaard Jensen & David Pisinger, 2014. "Bunker purchasing with contracts," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 16(4), pages 418-435, December.
    17. G Brønmo & M Christiansen & B Nygreen, 2007. "Ship routing and scheduling with flexible cargo sizes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1167-1177, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Said El Noshokaty, 2017. "Shipping Optimisation Systems (SOS): tramp optimisation perspective," Journal of Shipping and Trade, Springer, vol. 2(1), pages 1-36, December.
    2. Omholt-Jensen, Simen & Fagerholt, Kjetil & Meisel, Frank, 2025. "Fleet repositioning in the tramp ship routing and scheduling problem with bunker optimization: A matheuristic solution approach," European Journal of Operational Research, Elsevier, vol. 321(1), pages 88-106.
    3. Meng, Qiang & Wang, Shuaian & Lee, Chung-Yee, 2015. "A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 1-19.
    4. Wu, Lingxiao & Wang, Shuaian & Laporte, Gilbert, 2021. "The Robust Bulk Ship Routing Problem with Batched Cargo Selection," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 124-159.
    5. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
    6. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    7. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    8. Brønmo, Geir & Nygreen, Bjørn & Lysgaard, Jens, 2010. "Column generation approaches to ship scheduling with flexible cargo sizes," European Journal of Operational Research, Elsevier, vol. 200(1), pages 139-150, January.
    9. Charlotte Vilhelmsen & Richard M. Lusby & Jesper Larsen, 2017. "Tramp ship routing and scheduling with voyage separation requirements," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 913-943, October.
    10. Roar Grønhaug & Marielle Christiansen & Guy Desaulniers & Jacques Desrosiers, 2010. "A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem," Transportation Science, INFORMS, vol. 44(3), pages 400-415, August.
    11. Gustavo Diz & Luiz Felipe Scavarda & Roger Rocha & Silvio Hamacher, 2014. "Decision Support System for PETROBRAS Ship Scheduling," Interfaces, INFORMS, vol. 44(6), pages 555-566, December.
    12. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    13. Ricardo Gatica & Pablo Miranda, 2011. "Special Issue on Latin-American Research: A Time Based Discretization Approach for Ship Routing and Scheduling with Variable Speed," Networks and Spatial Economics, Springer, vol. 11(3), pages 465-485, September.
    14. Mulder, J. & Dekker, R., 2016. "Optimization in container liner shipping," Econometric Institute Research Papers EI2016-05, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Brønmo, Geir & Nygreen, Bjørn & Lysgaard, Jens, 2006. "Column generation approaches to ship scheduling with flexible cargo sizes," CORAL Working Papers L-2006-07, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    16. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
    17. Zeighami, Vahid & Saddoune, Mohammed & Soumis, François, 2020. "Alternating Lagrangian decomposition for integrated airline crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 287(1), pages 211-224.
    18. Christiansen, Marielle & Fagerholt, Kjetil & Rachaniotis, Nikolaos P. & Stålhane, Magnus, 2017. "Operational planning of routes and schedules for a fleet of fuel supply vessels," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 163-175.
    19. Daniel Müller & Kevin Tierney, 2017. "Decision support and data visualization for liner shipping fleet repositioning," Information Technology and Management, Springer, vol. 18(3), pages 203-221, September.
    20. Koza, David Franz, 2019. "Liner shipping service scheduling and cargo allocation," European Journal of Operational Research, Elsevier, vol. 275(3), pages 897-915.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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: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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.