Abstract
Imagine that your application requires to consider sequences of objects. Examples of this kind for instance occur at container terminals
where stacks of containers are stored and you need to know in what sequence these containers are put on each other in order to retrieve
a particular one. Another example are shunting yards where railroad carriages are parked. When you need to put a train together, you need
to know which carriages are placed on what tracks and in which order to select the right carriages for that particular train. In more general
terms, whenever you encounter a last–in–first–out (LIFO) storage system, you have to keep track of the sequence of items.
Typical planning problems in such situations include the Block Relocation Problem: In order to retrieve all items from LIFO stacks
in a particular order, relocations might be necessary to be able to reach the items that are to be retrieved first. To goal is to minimize
the number of required relocations. 
To model such ordered objects we present an idea that heavily makes use of the so–called local value. A concept that is known by
every first grader, but that has not been used in this context. We will demonstrate how relocations and retrievals from LIFO stacks can be
modeled in a novel way.