/
/
/
Matrix-Chain Multiplication Problem using Genetic Algorithm

Matrix-Chain Multiplication Problem Using Genetic Algorithm

Original Research ArticleNov 12, 2018Vol. 5 No. 1 (2005)

Abstract

Tree encoding has been studied for the genetic algorithm on artificial intelligence such as sequence induction, automatic programming, machine learning, and pattern recognition [5]. This paper also presents the tree encoding for the genetic algorithm in solving the matrix-chain multiplication, which is in the form A1 A2 A3 … AN where Ai is a matrix. Tress are generated as the way the matrices are fully parenthesized. Then crossover and mutation are applied. The fitness value is calculated and stored at the root of the tree.

Keywords:  tree encoding, matrix-chain multiplication, genetic algorithm

Corresponding author: E-mail: soonthar@cs.ucf.edu

How to Cite

Koompairojn*, S. ., & Le, M. . (2018). Matrix-Chain Multiplication Problem using Genetic Algorithm. CURRENT APPLIED SCIENCE AND TECHNOLOGY, 255-265.

References

  • Chandra, A.K. 1975 Computing matrix chain product in near optimal time. Rep. RC-5626, Thomas J. Watson Res. Ctr., Yorktown Heights, N.Y.
  • Chin, F.Y. 1978 An O(n) algorithm for determining a Near-Optimal Computation Order of Matrix Chain Products. Communications of the ACM, 21(7).
  • Cormen, T.H., Leiserson, C.E., Rivest, R.L. 1989 Introduction to Algorithms. MIT Press. McGraw-Hill.
  • Hu, T.C., and Shing, M.T. 1982 Computation of Matrix Chain Products Part I. SIAM J. computing, 11(2).
  • Koza, J.R. 1989 Hierarchical Genetic Algorithms Operating on Populations of Computer Programs. International Joint Conference on Artificial Intelligence.

Author Information

Soontharee Koompairojn*

School of Computer Science, University of Central Florida, Orlando, USA

Minh Le

School of Computer Science, University of Central Florida, Orlando, USA

About this Article

Journal

Vol. 5 No. 1 (2005)

Type of Manuscript

Original Research Article

Keywords

tree encoding, matrix-chain multiplication, genetic algorithm

Published

12 November 2018