Deriving a Robust Policy for Container Stacking Using a Noise-Tolerant Genetic Algorithm [Choe et. al, 2013]

• Only implemented in a static environment à was given a series of containers and its order, retrieve according to its order

• Calculate a score for each available stack to place the container using a weighted sum of the criteria score, which is calculated according to different rules depending on the situation and container type

Heuristic Algorithm [조현수, 2020]

• Implemented in dynamic stacking problem won 1 place in 2020

• Follow simple rules to decide target block and stack

• Prioritize taking-in block from arrival stack if it’s on maximum capacity

• For sending the block onto the handover stack, prioritize the block with the shortest due time

Optimization of the Scoring Function-based Strategy to Maximize Container Handling Efficiency in a Limited Buffer Storage Space [조현수, 2020]

• Implemented in dynamic stacking problem

• Using Multi-Criteria Decision Making to decide the type of job that will be done and the target buffer (same scoring to choose target buffer for every type of loading job)

• Type of jobs: fetching in, taking out, and reposition

• Each candidate block and buffer will be assessed using the weighted score of criteria

( - ) can’t prevent the bottleneck in the upstream process