IDEAS home Printed from https://ideas.repec.org/a/spr/josatr/v6y2021i1d10.1186_s41072-021-00097-z.html
   My bibliography  Save this article

Shipping optimization systems (SOS) for tramp: stochastic cargo soft time windows

Author

Listed:
  • Said El Noshokaty

    (Elesteshary Information Systems)

Abstract

Cargo time windows have been discussed in the shipping literature in several ways and within several contexts. One way considers the hard time windows, where a fixed date is assigned to both the open and close laycan for the cargo loading and discharging ports. According to this way, the cargo is rejected if the ship cannot meet these time windows. Another way develops soft time windows, where the ship for an additional cost or a penalty may violate the cargo laycan. The context in the previous ways includes a tramp deterministic model. In this paper, the soft time windows are considered within a context of a tramp stochastic model, where both the cargo transport demand and the laycan dates are random variables. The objective is a gross-profit-per-day accompanied with realistic shipping elements embedded into decision support systems known as shipping optimization systems (SOS). The chance-constraint programming and the modified version of the Dantzig–Wolfe decomposition principle known as block-angular linear ratio programming solve the problem. A case study demonstrates that using stochastic soft time windows with stochastic cargo transport demand has considerably improved the gross profit-per-day better than trying to arrive on time by varying ship speed or being within a non-stochastic shipping context.

Suggested Citation

  • Said El Noshokaty, 2021. "Shipping optimization systems (SOS) for tramp: stochastic cargo soft time windows," Journal of Shipping and Trade, Springer, vol. 6(1), pages 1-19, December.
    • Handle: RePEc:spr:josatr:v:6:y:2021:i:1:d:10.1186_s41072-021-00097-z
    DOI: 10.1186/s41072-021-00097-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1186/s41072-021-00097-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1186/s41072-021-00097-z?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.

    References listed on IDEAS

    as
    1. Marielle Christiansen & Kjetil Fagerholt & David Ronen, 2004. "Ship Routing and Scheduling: Status and Perspectives," Transportation Science, INFORMS, vol. 38(1), pages 1-18, February.
    2. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    3. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    4. Yiannis A. Koskosidis & Warren B. Powell & Marius M. Solomon, 1992. "An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints," Transportation Science, INFORMS, vol. 26(2), pages 69-85, May.
    5. Said El Noshokaty, 2014. "Block-angular linear ratio programmes," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 19(3), pages 338-357.
    6. Said El Noshokaty, 2017. "Shipping Optimisation Systems (SOS): tramp optimisation perspective," Journal of Shipping and Trade, Springer, vol. 2(1), pages 1-36, December.
    7. Said El Noshokaty, 2017. "Erratum to: Shipping Optimisation Systems (SOS): tramp optimisation perspective," Journal of Shipping and Trade, Springer, vol. 2(1), pages 1-1, December.
    8. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    9. A. Charnes & W. W. Cooper, 1959. "Chance-Constrained Programming," Management Science, INFORMS, vol. 6(1), pages 73-79, October.
    10. F. Errico & G. Desaulniers & M. Gendreau & W. Rei & L.-M. Rousseau, 2018. "The vehicle routing problem with hard time windows and stochastic service times," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 223-251, September.
    11. Marielle Christiansen & Kjetil Fagerholt, 2002. "Robust ship scheduling with multiple time windows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 611-625, 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. Jasmine Lam, 2010. "An integrated approach for port selection, ship scheduling and financial analysis," Netnomics, Springer, vol. 11(1), pages 33-46, April.
    3. Kjetil Fagerholt *, 2004. "Designing optimal routes in a liner shipping problem," Maritime Policy & Management, Taylor & Francis Journals, vol. 31(4), pages 259-268, October.
    4. 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.
    5. 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.
    6. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    7. 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.
    8. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    9. Agostinho Agra & Marielle Christiansen & Alexandrino Delgado, 2013. "Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem," Transportation Science, INFORMS, vol. 47(1), pages 108-124, February.
    10. Matteo Salani & Maria Battarra, 2018. "The opportunity cost of time window violations," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 343-361, December.
    11. 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.
    12. Rigot-Müller, Patrick & Cheaitou, Ali & Etienne, Laurent & Faury, Olivier & Fedi, Laurent, 2022. "The role of polarseaworthiness in shipping planning for infrastructure projects in the Arctic: The case of Yamal LNG plant," Transportation Research Part A: Policy and Practice, Elsevier, vol. 155(C), pages 330-353.
    13. J E Korsvik & K Fagerholt & G Laporte, 2010. "A tabu search heuristic for ship routing and scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 594-603, April.
    14. Hennig, F. & Nygreen, B. & Furman, K.C. & Song, J., 2015. "Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery," European Journal of Operational Research, Elsevier, vol. 243(1), pages 41-51.
    15. 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.
    16. Xi Jiang & Haijun Mao & Yadong Wang & Hao Zhang, 2020. "Liner Shipping Schedule Design for Near-Sea Routes Considering Big Customers’ Preferences on Ship Arrival Time," Sustainability, MDPI, vol. 12(18), pages 1-20, September.
    17. Kangbok Lee & Byung‐Cheon Choi & Joseph Y‐T. Leung & Michael L. Pinedo & Dirk Briskorn, 2012. "Minimizing the total weighted delivery time in container transportation scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 266-277, April.
    18. Pang, King-Wah & Xu, Zhou & Li, Chung-Lun, 2011. "Ship routing problem with berthing time clash avoidance constraints," International Journal of Production Economics, Elsevier, vol. 131(2), pages 752-762, June.
    19. Borzou Rostami & Guy Desaulniers & Fausto Errico & Andrea Lodi, 2021. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times," Operations Research, INFORMS, vol. 69(2), pages 436-455, March.
    20. Nikolaos Charalambopoulos & Andreas C. Nearchou, 2021. "Ship Routing Using Genetic Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.

    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:spr:josatr:v:6:y:2021:i:1:d:10.1186_s41072-021-00097-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.