Skip to main content

A Vessel Scheduling Problem with Special Cases

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 509))

Included in the following conference series:

  • 597 Accesses

Abstract

We study the inventory and distribution operations encountered in oil and petrochemical industry. We show some special cases for the NP-complete problem, and propose polynomial time solution methods. We propose two approaches for the main problem. One of them makes use of the minimum cost flow formulation of the same problem under some assumptions, and the other one uses Benders Decomposition. In addition, we propose another problem and its formulation which involves time-windows for delivery, for which the same approaches can be applied. However, methodology or the results for the latter problem are not given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Lkketangen, A.: Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37(9), 1515–1536 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bendall, H., Stent, A.: A scheduling model for a high speed containership service: a hub and spoke short-sea application. Int. J. Marit. Econ. 3(3), 262–277 (2001)

    Article  Google Scholar 

  3. Bookbinder, J., Reece, K.: Vehicle routing considerations in distribution system design. Eur. J. Oper. Res. 37(2), 204–213 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cho, S., Perakis, A.: Optimal liner fleet routeing strategies. Marit. Policy Manag. 23(3), 249–259 (1996)

    Article  Google Scholar 

  5. Cho, S., Perakis, A.: An improved formulation for bulk cargo ship scheduling with a single loading port. Marit. Policy Manag. 28(4), 339–345 (2001)

    Article  Google Scholar 

  6. Choi, B., Lee, K., Leung, J., Pinedo, M., Briskorn, D.: Container scheduling: complexity and algorithms. Prod. Oper. Manag. 21(1), 115–128 (2012)

    Article  Google Scholar 

  7. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. Eur. J. Oper. Res. 228(3), 467–483 (2012)

    Google Scholar 

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

    Article  Google Scholar 

  9. Detti, P.: A polynomial algorithm for the multiple knapsack problem with divisible item sizes. Inf. Process. Lett. 109(11), 582–584 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gheysens, F., Golden, B., Assad, A.: A comparison of techniques for solving the fleet size and mix vehicle routing problem. OR Spectr. 6(4), 207–216 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hoff, A., Andersson, H., Christiansen, M., Hasle, G., Lkketangen, A.: Industrial aspects and literature survey: fleet composition and routing. Comput. Oper. Res. 37(12), 2041–2061 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lei, L., Zhong, H., Chaovalitwongse, W.: On the integrated production and distribution problem with bidirectional flows. INFORMS J. Comput. 21(4), 585–598 (2009)

    Article  Google Scholar 

  13. Nicholson, T., Pullen, R., Dynamic programming applied to ship fleet management. Oper. Res. Quart. 22(3), 211–220 (1971)

    Google Scholar 

  14. Ronen, D.: Short-term scheduling of vessels for shipping bulk or semi-bulk commodities originating in a single area. Oper. Res. 34(1), 164–173 (1986)

    Article  MATH  Google Scholar 

  15. Wu, P., Hartman, J., Wilson, G.: An integrated model and solution approach for fleet sizing with heterogeneous assets. Transp. Sci. 39(1), 87–103 (2005)

    Article  Google Scholar 

  16. Xinlian, X., Tengfei, W., Daisong, C.: A dynamic model and algorithm for fleet planning. Marit. Policy Manag. 27(1), 53–63 (2000)

    Article  Google Scholar 

Download references

Acknowledgements

This report was made possible by a National Priorities Research Program grant from the Qatar National Research Fund (a member of The Qatar Foundation). The statements made herein are solely the responsibility of the authors.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Selim Bora .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bora, S., Boros, E., Lei, L., Chovalitwongse, W.A., Lim, G.J., Parsaei, H.R. (2015). A Vessel Scheduling Problem with Special Cases. In: Pinson, E., Valente, F., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2014. Communications in Computer and Information Science, vol 509. Springer, Cham. https://doi.org/10.1007/978-3-319-17509-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17509-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17508-9

  • Online ISBN: 978-3-319-17509-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics