Skip to main content
Log in

Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques

  • Original Paper
  • Area 3
  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

Ship scheduling problem is an important operational level planning problem in maritime logistics. In this paper, we show how we designed and developed a mathematical model for real-world tanker scheduling problem in Japan. Tanker operators own their fleet of tankers and make their schedules for the next several weeks for meeting customers’ demands. However, due to the high uncertainty of the ship operations and unexpected changes of demands, the schedules has to be revised frequently. Our methodology allows the operators to determine schedules that minimize the operational cost in a few minutes. These solutions provides cost improvements for tanker operators, as measured by reduction of 5–16%.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ronen D.: Cargo ships routing and scheduling: survey of models and problems. Eur. J. Oper. Res. 12, 119–126 (1983)

    Article  Google Scholar 

  2. Ronen D.: Ship scheduling: the last decade. Eur. J. Oper. Res. 81, 325–333 (1993)

    Article  Google Scholar 

  3. Christiansen M., Fagerholt K., Ronen D.: Ship routing and scheduling: status and perspectives. Transp. Sci. 38, 1–18 (2004)

    Article  Google Scholar 

  4. Brown G.G., Graves W., Ronen D.: Scheduling ocean transportation of crude oil. Manag. Sci. 33, 335–346 (1987)

    Article  Google Scholar 

  5. Desrosiers J., Dumas Y., Solomon M.M., Soumis F.: Time constrained routing and scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds) Network Routing, Handbooks in Operations Research and Management Science, 8, Elsevier, Amsterdam (1995)

    Google Scholar 

  6. Fagerholt K., Christiansen M.: A combined ship scheduling and allocation problem. J. Oper. Res Soc. 51, 834–842 (2000)

    MATH  Google Scholar 

  7. Fagerholt K., Christiansen M.: A travelling salesman problem with allocation, time window and precedence constraints—an application to ship scheduling. Int. Trans. Oper. Res. 7, 231–244 (2000)

    Article  MathSciNet  Google Scholar 

  8. Appelgren L.H.: A column generation algorithm for a ship scheduling problem. Transp. Sci. 3, 53–68 (1969)

    Article  Google Scholar 

  9. Appelgren L.H.: Integer programming methods for a vessel scheduling problem. Transp. Sci. 5, 64–78 (1971)

    Article  Google Scholar 

  10. Desauliniers, G., Derosiers, J., Solomon, M.M. (eds.): Column Generation, GERAD 25th Anniversary Series, Springer, New York (2005)

  11. Christiansen M., Fagerholt K.: Robust ship scheduling with multiple time windows. Nav. Res. Logist. 49(6), 611–625 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Al-Khayyal F., Hwang S.-J.: Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model. Eur. J. Oper. Res. 176, 106–130 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Dantzig G.B., Wolfe P.: Decomposition principle for linear programs. Oper. Res. 8, 101–111 (1960)

    Article  MATH  Google Scholar 

  14. Desrochers M., Soumis F.: A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR. 26, 191–212 (1988)

    MATH  Google Scholar 

  15. Dash Optimization: The Xpress-Optimizer. http://www.dashoptimization.com/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kazuhiro Kobayashi.

About this article

Cite this article

Kobayashi, K., Kubo, M. Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques. Japan J. Indust. Appl. Math. 27, 161–173 (2010). https://doi.org/10.1007/s13160-010-0008-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13160-010-0008-7

Keywords

Navigation