IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v49y2002i6p611-625.html
   My bibliography  Save this article

Robust ship scheduling with multiple time windows

Author

Listed:
  • Marielle Christiansen
  • Kjetil Fagerholt

Abstract

We present a ship scheduling problem concerned with the pickup and delivery of bulk cargoes within given time windows. As the ports are closed for service at night and during weekends, the wide time windows can be regarded as multiple time windows. Another issue is that the loading/discharging times of cargoes may take several days. This means that a ship will stay idle much of the time in port, and the total time at port will depend on the ship's arrival time. Ship scheduling is associated with uncertainty due to bad weather at sea and unpredictable service times in ports. Our objective is to make robust schedules that are less likely to result in ships staying idle in ports during the weekend, and impose penalty costs for arrivals at risky times (i.e., close to weekends). A set partitioning approach is proposed to solve the problem. The columns correspond to feasible ship schedules that are found a priori. They are generated taking the uncertainty and multiple time windows into account. The computational results show that we can increase the robustness of the schedules at the sacrifice of increased transportation costs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 611–625, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10033

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:49:y:2002:i:6:p:611-625
    DOI: 10.1002/nav.10033
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10033
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10033?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
    ---><---

    References listed on IDEAS

    as
    1. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    2. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    3. Marielle Christiansen & Bjorn Nygreen, 1998. "A method for solving ship routing problemswith inventory constraints," Annals of Operations Research, Springer, vol. 81(0), pages 357-378, June.
    4. Gerald G. Brown & Glenn W. Graves & David Ronen, 1987. "Scheduling Ocean Transportation of Crude Oil," Management Science, INFORMS, vol. 33(3), pages 335-346, March.
    5. 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.
    6. Yvan Dumas & François Soumis & Jacques Desrosiers, 1990. "Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs," Transportation Science, INFORMS, vol. 24(2), pages 145-152, May.
    7. Darby-Dowman, K. & Fink, R. K. & Mitra, G. & Smith, J. W., 1995. "An intelligent system for US Coast Guard cutter scheduling," European Journal of Operational Research, Elsevier, vol. 87(3), pages 574-585, December.
    8. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling," Transportation Science, INFORMS, vol. 19(4), pages 378-410, November.
    9. Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
    10. Gerald G. Brown & Clark E. Goodman & R. Kevin Wood, 1990. "Annual Scheduling of Atlantic Fleet Naval Combatants," Operations Research, INFORMS, vol. 38(2), pages 249-259, April.
    11. Éric Taillard & Philippe Badeau & Michel Gendreau & François Guertin & Jean-Yves Potvin, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 31(2), pages 170-186, May.
    12. Pesant, Gilles & Gendreau, Michel & Potvin, Jean-Yves & Rousseau, Jean-Marc, 1999. "On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 117(2), pages 253-263, September.
    13. 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.
    14. 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.
    15. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing," Transportation Science, INFORMS, vol. 19(4), pages 411-435, November.
    16. Christophe Duhamel & Jean-Yves Potvin & Jean-Marc Rousseau, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows," Transportation Science, INFORMS, vol. 31(1), pages 49-59, February.
    17. Yvan Dumas & Jacques Desrosiers & Eric Gelinas & Marius M. Solomon, 1995. "An Optimal Algorithm for the Traveling Salesman Problem with Time Windows," Operations Research, INFORMS, vol. 43(2), pages 367-371, April.
    18. Fagerholt, Kjetil & Lindstad, Håkon, 2000. "Optimal policies for maintaining a supply service in the Norwegian Sea," Omega, Elsevier, vol. 28(3), pages 269-275, June.
    19. Marielle Christiansen, 1999. "Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem," Transportation Science, INFORMS, vol. 33(1), pages 3-16, February.
    20. Ronen, David, 1983. "Cargo ships routing and scheduling: Survey of models and problems," European Journal of Operational Research, Elsevier, vol. 12(2), pages 119-126, February.
    21. K Fagerholt & M Christiansen, 2000. "A combined ship scheduling and allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(7), pages 834-842, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. Agostinho Agra & Marielle Christiansen & Lars Magnus Hvattum & Filipe Rodrigues, 2018. "Robust Optimization for a Maritime Inventory Routing Problem," Transportation Science, INFORMS, vol. 52(3), pages 509-525, June.
    4. Jasmine Lam, 2010. "An integrated approach for port selection, ship scheduling and financial analysis," Netnomics, Springer, vol. 11(1), pages 33-46, April.
    5. Kjetil Fagerholt *, 2004. "Designing optimal routes in a liner shipping problem," Maritime Policy & Management, Taylor & Francis Journals, vol. 31(4), pages 259-268, October.
    6. Sinan Gürel & Aysan Shadmand, 2019. "A heterogeneous fleet liner ship scheduling problem with port time uncertainty," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(4), pages 1153-1175, December.
    7. Ksciuk, Jana & Kuhlemann, Stefan & Tierney, Kevin & Koberstein, Achim, 2023. "Uncertainty in maritime ship routing and scheduling: A Literature review," European Journal of Operational Research, Elsevier, vol. 308(2), pages 499-524.
    8. 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.
    9. 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.
    10. 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.
    11. Marielle Christiansen & Kjetil Fagerholt & David Ronen, 2004. "Ship Routing and Scheduling: Status and Perspectives," Transportation Science, INFORMS, vol. 38(1), pages 1-18, February.

    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. 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.
    2. Marielle Christiansen & Kjetil Fagerholt & David Ronen, 2004. "Ship Routing and Scheduling: Status and Perspectives," Transportation Science, INFORMS, vol. 38(1), pages 1-18, February.
    3. 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.
    4. R A Russell & T L Urban, 2008. "Vehicle routing with soft time windows and Erlang travel times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1220-1228, September.
    5. K Fagerholt & B A Foss & O J Horgen, 2009. "A decision support model for establishing an air taxi service: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1173-1182, September.
    6. K Fagerholt & G Laporte & I Norstad, 2010. "Reducing fuel emissions by optimizing speed on shipping routes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 523-529, March.
    7. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    8. Mitrovic-Minic, Snezana & Laporte, Gilbert, 2004. "Waiting strategies for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 635-655, August.
    9. 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.
    10. 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.
    11. 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.
    12. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    13. Z Fu & R Eglese & L Y O Li, 2008. "A unified tabu search algorithm for vehicle routing problems with soft time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 663-673, May.
    14. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    15. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    16. Qie He & Stefan Irnich & Yongjia Song, 2019. "Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Transportation Science, INFORMS, vol. 53(5), pages 1409-1426, September.
    17. Persson, Jan A. & Gothe-Lundgren, Maud, 2005. "Shipment planning at oil refineries using column generation and valid inequalities," European Journal of Operational Research, Elsevier, vol. 163(3), pages 631-652, June.
    18. 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.
    19. Xu, Dongyang & Li, Kunpeng & Zou, Xuxia & Liu, Ling, 2017. "An unpaired pickup and delivery vehicle routing problem with multi-visit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 218-247.
    20. 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.

    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:wly:navres:v:49:y:2002:i:6:p:611-625. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.