© 2018, Springer Science+Business Media, LLC, part of Springer Nature. In this paper, a multiobjective dynamic bin packing problem for storing cooling objects is introduced along with a metaheuristic designed to work well in mixed-variable environments. The dynamic bin packing problem is based on cookie production at a bakery, where cookies arrive in batches at a cooling rack with limited capacity and are packed into boxes with three competing goals. The first is to minimize the number of boxes used. The second objective is to minimize the average initial heat of each box, and the third is to minimize the maximum time until the boxes can be moved to the storefront. The metaheuristic developed here incorporated greedy heuristics into an adaptive evolutionary framework with partial decomposition into clusters of solutions for the crossover operator. The new metaheuristic was applied to a variety benchmark bin packing problems and to a small and large version of the dynamic bin packing problem. It performed as well as other metaheuristics in the benchmark problems and produced more diverse solutions in the dynamic problems. It performed better overall in the small dynamic problem, but its performance could not be proven to be better or worse in the large dynamic problem.
- Dynamic Bin Packing Problem
- Multiobjective Combinatorial Optimization
- Memetic Algorithms