Using fast matrix multiplication in bio-inspired computation for complex optimization problems

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.

[1]  Günther R. Raidl,et al.  Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem , 2007, EvoCOP.

[2]  Ingo Wegener,et al.  The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems , 2004 .

[3]  Alberto Caprara,et al.  Properties of some ILP Formulations of a Class of Partitioning Problems , 1998, Discret. Appl. Math..

[4]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[5]  Carsten Witt,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .

[6]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

[7]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[8]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[9]  Frank Neumann,et al.  Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.

[10]  David Pisinger.  An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[11]  Günther R. Raidl,et al.  An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing , 2004, PPSN.

[12]  Jacques Cohen,et al.  On the implementation of Strassen's fast multiplication algorithm , 2004, Acta Informatica.

[13]  Frank Neumann,et al.  A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems , 2006, EvoCOP.

[14]  Jeremy D. Frens,et al.  Morton-order Matrices Deserve Compilers ’ Support Technical Report 533 , 1999 .

[15]  Won-Taek Lim,et al.  Evaluating ISA Support and Hardware Support for Recursive Data Layouts , 2007, HiPC.

[16]  Hasan Pirkul,et al.  A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .

[17]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[18]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[19]  Christopher Umans.  Group-theoretic algorithms for matrix multiplication , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[20]  Günther R. Raidl,et al.  The Core Concept for the Multidimensional Knapsack Problem , 2006, EvoCOP.

[21]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[22]  Mithuna Thottethodi,et al.  Recursive Array Layouts and Fast Matrix Multiplication , 2002, IEEE Trans. Parallel Distributed Syst..

[23]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .