OptiStack
Powered by the Grouping Genetic Algorithms of Optimal Design's own invention, OptiStack offers both an unprecedented quality of its solutions and a near real-time computation time. Indeed:
  • thanks to continuous optimisation, the number of remaining unproductive container moves is drastically reduced, to none at all in many cases;
  • the speed of the computation offers the Holy Grail in container stacking, namely the capacity to immediately react to incoming information on expected container leave times.

Product Description

Download the detailed description of how OptiStack works and the values it brings in cargo ports' containers yard management, more specifically by significantly reducing operational waste and shortening cargo ships load and unload times by several hours when not days.

View a short edited introduction version of an OptiStack optimisation (download). Or view the full version!

A Hard Optimisation Problem

Most container terminals (yards), typically found in maritime ports, are constrained in their surface and can only offer the necessary storage capacity by stacking containers ones on top the others, in piles. While this does solve the capacity problem, it creates another one: it happens that a container must be retrieved while other containers are stacked above it in its pile. In that case, in order to retrieve the sought-for container, the ones above it must first be moved elsewhere, yielding unproductive container moves.

It turns out that these unproductive container moves are a serious hindrance on the terminal's efficiency. Indeed, some terminals spend nearly half of their container moving time on just getting rid of the containers on top of the ones that actually need to be retrieved!
Yet the unproductive container moves are only due to the fact that the containers were stacked in the wrong places on their arrival: if every container was immediately placed in such a way (on such a pile) that when it needs to be retrieved there is no other container above it, no unproductive moves would take place.

It turns out that deciding at their arrival time where (on which pile) each container should be placed so that at their departure (i.e. retrieval) time they would indeed be on top of their pile is an extremely difficult optimisation problem.
Many techniques have been proposed to solve the problem and all have failed: fast/simple heuristics offer solutions that leave very much to be desired (many unproductive moves are still necessary), while enumerative methods never even finish computing within the timeframe needed by the terminal.


A Full Optimisation Sample
View the full real-time capture of this yard stacking optimisation sample, reducing the total wasted moves from 7178 down to zero in only 3 mins 43 sec! (download)