Harmony search to solve the container storage problem with different container types
This work addresses a domain-specific logistics optimization problem for container terminal operations, presenting an incremental improvement over existing methods.
The paper tackled the container storage allocation problem with multiple container types by adapting the harmony search algorithm to minimize re-handle operations while respecting departure dates, and it verified performance by comparing results to genetic and LIFO algorithms.
This paper presents an adaptation of the harmony search algorithm to solve the storage allocation problem for inbound and outbound containers. This problem is studied considering multiple container type (regular, open side, open top, tank, empty and refrigerated) which lets the situation more complicated, as various storage constraints appeared. The objective is to find an optimal container arrangement which respects their departure dates, and minimize the re-handle operations of containers. The performance of the proposed approach is verified comparing to the results generated by genetic algorithm and LIFO algorithm.