A 'less-flexibility-first' heuristic for the placement of inland vessels in a lock

Abstract

Inland vessels move goods along waterways (canals and rivers) and they visit ports. Because of their tidal nature, vessels make use of locks to enter ports or waterways. From a port management point of view, fast access to and from the port and high utilization of locks are important objectives. Where the former relates to low inbound and outbound waiting times, the latter relates to the placement of as many vessels as possible in the lock before its operation. This article includes a case study that relates to the operation of the Van Cauwelaert lock in the port of Antwerp, Belgium. Lock operation policy is as follows: vessels wait in front of the lock for a port administrator to assign places in the lock based on knowledge of the vessels' dimensions. As such, there is no FIFO-discipline, but a 'group-FIFO'-discipline, i.e. if n vessels are allowed into the lock, they are the first n vessels in the arrival queue. A heuristic algorithm is formulated for the placement of vessels in the lock. This algorithm supports the decision where to place the vessel in the lock, aiming to place as many vessels as possible from the arrival queue. At the same time, it supports the decision to start a locking operation or not, based on information about vessels that are announced but which have not yet arrived at the lock's entrance. The heuristic is called a 'less-flexibility-first'-heuristic as it looks for pseudo-placements, showing which flexibility is left for the remaining vessels after placing a vessel. This article describes the implementation of the heuristic and provides numerical examples. A comparison is made between the heuristic results and daily practice, based on real-life vessel movements through the Van Cauwelaert lock in 2002.