Skip to main content
SpringerLink
Log in

A Hybrid Reactive Tabu Search for Liner Shipping Fleet Repositioning

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9335))

Included in the following conference series:

Abstract

We solve the liner shipping fleet repositioning problem (LSFRP), a key problem in the liner shipping industry, using a hybrid reactive tabu search and simulated annealing algorithm in combination with novel local search neighborhoods. Liner carriers reposition vessels between services in order to add, remove or modify services in their network. Repositioning vessels costs between hundreds of thousands and millions of dollars, meaning finding cost efficient repositioning plans is an important goal for liner carriers. We introduce a reactive tabu search approach and hybridize it with simulated annealing, allowing us to find a combined $147,000 in additional profit over the state-of-the-art approach across 44 public LSFRP instances.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA journal on computing 6(2), 126–140 (1994)

    Article  MATH  Google Scholar 

  2. Battiti, R., Tecchiolli, G.: Training neural nets with the reactive tabu search. IEEE Transactions on Neural Networks 6(5), 1185–1200 (1995)

    Article  Google Scholar 

  3. Brouer, B.D., Alvarez, J.F., Plum, C.E.M., Pisinger, D., Sigurd, M.M.: A base integer programming model and benchmark suite for liner-shipping network design. Transportation Science 48(2), 281–312 (2014)

    Article  Google Scholar 

  4. Brouer, B.D., Dirksen, J., Pisinger, D., Plum, C.E.M., Vaaben, B.: The Vessel Schedule Recovery Problem (VSRP) - A MIP model for handling disruptions in liner shipping. European Journal of Operational Research 224(2), 362–374 (2013)

    Article  MATH  Google Scholar 

  5. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime transportation. Handbooks in operations research and management science 14, 189–284 (2007)

    Article  Google Scholar 

  6. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. European Journal of Operational Research 228(3), 467–483 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gendreau, M., Potvin, J.-Y.: Tabu search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 41–59. Springer, US (2010)

    Google Scholar 

  8. Glover, F.: Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem. Univ. of Colorado, Graduate School of Business (1991)

    Google Scholar 

  9. Kelareva, E., Tierney, K., Kilby, P.: CP methods for scheduling and routing with time-dependent task costs. EURO Journal on Computational Optimization 2(3), 147–194 (2014)

    Article  MATH  Google Scholar 

  10. Kohl, N., Larsen, A., Larsen, J., Ross, A., Tiourine, S.: Airline disruption management-perspectives, experiences and outlook. Journal of Air Transport Management 13(3), 149–162 (2007)

    Article  Google Scholar 

  11. Korsvik, J.E., Fagerholt, K., Laporte, G.: A large neighbourhood search heuristic for ship routing and scheduling with split loads. Computers and Operations Research 38(2), 474–483 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Loureņo, H.R., Martin, O.C., Stützle, T.: Iterated local search. In : Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in OR & MS, vol. 57, pp. 320–353. Springer (2003)

    Google Scholar 

  13. Meyer, J., Stahlbock, R., Voß, S.: Slow steaming in container shipping. In: HICSS-45, pp. 1306–1314. IEEE (2012)

    Google Scholar 

  14. Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Computers and Operations Research 45, 12–24 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tierney, K.: Optimizing Liner Shipping Fleet Repositioning Plans. Operations Research/Computer Science Interfaces Series, vol. 57. Springer (2015)

    Google Scholar 

  16. Tierney, K., Áskelsdóttir, B., Jensen, R.M., Pisinger, D.: Solving the liner shipping fleet repositioning problem with cargo flows. Transportation Science (2014)

    Google Scholar 

  17. Tierney, K., Coles, A.J., Coles, A.I., Kroer, C., Britt, A.M., Jensen, R.M.: Automated planning for liner shipping fleet repositioning. In: McCluskey, L., Williams, B., Silva, J.R., Bonet, B. (eds.) Proceedings of ICAPS-2012, pp. 279–287 (2012)

    Google Scholar 

  18. Tierney, K., Jensen, R.M.: The liner shipping fleet repositioning problem with cargo flows. In: Hu, H., Shi, X., Stahlbock, R., Voß, S. (eds.) ICCL 2012. LNCS, vol. 7555, pp. 1–16. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Tierney, K., Jensen, R.M.: A node flow model for the inflexible visitation liner shipping fleet repositioning problem with cargo flows. In: Pacino, D., Voß, S., Jensen, R.M. (eds.) ICCL 2013. LNCS, vol. 8197, pp. 18–34. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  20. United Nations Conference on Trade and Development (UNCTAD). Review of maritime transport (2013)

    Google Scholar 

  21. Voß, S., Fink, A.: Hybridizing reactive tabu search with simulated annealing. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol. 7219, pp. 509–512. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Decision Support and Operations Research Lab, University of Paderborn, Paderborn, Germany

    Mark Becker & Kevin Tierney

Authors
  1. Mark Becker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kevin Tierney
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kevin Tierney .

Editor information

Editors and Affiliations

  1. Delft University of Technology, Delft, The Netherlands

    Francesco Corman

  2. University of Hamburg, Hamburg, Germany

    Stefan Voß

  3. Delft University of Technology, Delft, The Netherlands

    Rudy R. Negenborn

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Becker, M., Tierney, K. (2015). A Hybrid Reactive Tabu Search for Liner Shipping Fleet Repositioning. In: Corman, F., Voß, S., Negenborn, R. (eds) Computational Logistics. ICCL 2015. Lecture Notes in Computer Science(), vol 9335. Springer, Cham. https://doi.org/10.1007/978-3-319-24264-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24264-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24263-7

  • Online ISBN: 978-3-319-24264-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation