Building Hyper-heuristics Through Ant Colony Optimization for the 2D Bin Packing Problem

摘要: Convergence proofs for ant colony optimization are limited [1], only in some cases it is possible to assure that the algorithm will find an optimal solution. It even more difficult state how long take, but has been found experimentally computing time increases at least exponentially with size of problem [2]. To overcome this, concept hyper-heuristics could be applied. The idea behind combination simple heuristics solve a instead than solving directly. In this paper we introduce first attempt combine ACO algorithm. resulting was applied two-dimensional bin packing problem, and encouraging results were obtained when classic instances taken from literature. performance our approach always equal or better any studied, comparable best metaheuristics known.