Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
Date
2008
Authors
Diedrich, F.
Neumann, F.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the IEEE Congress on Evolutionary Computation, 2008 (IEEE World Congress on Computational Intelligence), 1-6 June, 2008, pp. 3827-3832
Statement of Responsibility
Florian Diedrich and Frank Neumann
Conference Name
IEEE Congress on Evolutionary Computation (2008 : Hong Kong)
Abstract
Population-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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2008 IEEE