Principles of Combinatorial Optimization Applied to Container-Ship Stowage Planning

  • Authors:
  • I. D. Wilson;P. A. Roach

  • Affiliations:
  • Division of Mathematics and Computing, University of Glamorgan, Pontypridd, CF37 1DL, United Kingdom;Division of Mathematics and Computing, University of Glamorgan, Pontypridd, CF37 1DL, United Kingdom. proach@glam.ac.uk

  • Venue:
  • Journal of Heuristics
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a methodology for generating automatedsolutions to the container stowage problem is shown. The methodologywas derived by applying principles of combinatorial optimization and,in particular, the Tabu Search metaheuristic. The methodologyprogressively refines the placement of containers, using the Tabusearch concept of neighbourhoods, within the cargo-space of acontainer ship until each container is specifically allocated to astowage location. Heuristic rules are built into objective functionsfor each stage that enable the combinatorial tree to be explored inan intelligent way, resulting in good, if not optimal, solutions forthe problem in a reasonable processing time.