The container stowage problem concerns the suitable placement of containers
in a container-ship on a multi-port journey; it requires consideration of
the consequences each placement has on decisions at subsequent ports. A met
hodology for the automatic generation of computerised solutions to the cont
ainer stowage problem is shown; objective functions that provide a basis fo
r evaluating solutions are given in addition to the underlying structures a
nd relationships that embody this problem. The methodology progressively re
fines the placement of containers within the cargo-space of a container shi
p until each container is specifically allocated to a stowage location. The
methodology embodies a two stage process to computerised planning, that of
a generalised placement strategy and a specialised placement procedure. He
uristic rules are built into objective functions for each stage that enable
the combinatorial tree to be explored in an intelligent way, resulting in
good, if not optimal, solutions for the problem in a reasonable processing
time.