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
Koompairojn*, S. ., & Le, M. . (2018). Matrix-Chain Multiplication Problem using Genetic Algorithm. CURRENT APPLIED SCIENCE AND TECHNOLOGY, 255-265.
