Combining population-based and exact methods for multi-level capacitated lot-sizing problems

摘要

We present an ant-based algorithm to solve multi-level capacitated lot-sizing problems. We apply a hybrid approach where we use the ant system to optimize the decomposition of the problem into smaller subproblems. These subproblems, containing only a few items and periods, are solved using CPLEX. Then the overall solution is derived by consolidating the partial solutions. This hybrid approach provides superior results with respect to solution quality in comparison with the existing approaches in the literature.