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.
Cite
CITATION STYLE
Becker, M., & Tierney, K. (2015). A hybrid reactive tabu search for liner shipping fleet repositioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9335, pp. 123–138). Springer Verlag. https://doi.org/10.1007/978-3-319-24264-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
