On solving the double loading problem using a modified particle swarm optimization

We consider in this paper a double loading problem (DLP), an NP-hard optimization problem of extreme economic relevance in industrial areas. The problem consists in loading items into bins, then stowing bins in a set of compartments. The main objective is to minimize the number of used bins. We state the mathematical model as well as a modified binary particle swarm optimization with FFD initialization that outperforms state-of-the-art approaches carried out on a large testbed instances.