Diedrich, F.Neumann, F.2011-10-142011-10-142008Proceedings of the IEEE Congress on Evolutionary Computation, 2008 (IEEE World Congress on Computational Intelligence), 1-6 June, 2008, pp. 3827-38329781424418220http://hdl.handle.net/2440/66761Population-based search heuristics such as evolutionary algorithms or ant colony optimization have been widely used to tackle complex problems in combinatorial optimization. In many cases these problems involve the optimization of an objective function subject to a set of constraints which is very large. In this paper, we examine how population-based search heuristics can be sped up by making use of fast matrix multiplication algorithms. First, we point out that this approach is applicable to the wide class of problems which can be expressed as an Integer Linear Program (ILP). Later on, we investigate the speedup that can be gained by the proposed approach in our experimental studies for the multidimensional knapsack problem.en© 2008 IEEEConference paper002010705010.1109/CEC.2008.46313170002634065020912-s2.0-5574911611730401Neumann, F. [0000-0002-2721-3618]