Optimal sequence for chain matrix multiplication using evolutionary algorithm

The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM). This problem arises in various scientific applications such as in electronics, robotics, mathematical programing, and cryptography....

Full description

Saved in:
Bibliographic Details
Published in:PeerJ. Computer science 2021-02, Vol.7, p.e395-e395, Article e395
Main Authors: Iqbal, Umer, Shoukat, Ijaz Ali, Elahi, Ihsan, Kanwal, Afshan, Farrukh, Bakhtawar, A Alqahtani, Mohammed, Rauf, Abdul, Alqurni, Jehad Saad
Format: Article
Language:English
Subjects:
Algorithms
Algorithms and Analysis of Algorithms
Analysis
Applied mathematics
Arithmetic
Chain matrix multiplication
Chains
Computational efficiency
Computing time
Counseling
Cryptography
Datasets
Dynamic programming
Evolutionary algorithm
Evolutionary algorithms
Genetic algorithms
Literature reviews
Mathematical analysis
Matrix methods
Multiplication
Optimization
Optimization Theory and Computation
Population
Robotics
Technology application
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM). This problem arises in various scientific applications such as in electronics, robotics, mathematical programing, and cryptography. For CMMP the researchers have proposed various techniques such as dynamic approach, arithmetic approach, and sequential multiplication. However, these techniques are deficient for providing optimal results for CMMP in terms of computational time and significant amount of scalar multiplication. In this article, we proposed a new model to minimize the Chain Matrix Multiplication (CMM) operations based on group counseling optimizer (GCO). Our experimental results and their analysis show that the proposed GCO model has achieved significant reduction of time with efficient speed when compared with sequential chain matrix multiplication approach. The proposed model provides good performance and reduces the multiplication operations varying from 45% to 96% when compared with sequential multiplication. Moreover, we evaluate our results with the best known dynamic programing and arithmetic multiplication approaches, which clearly demonstrate that proposed model outperforms in terms of computational time and space complexity.
ISSN:2376-5992
2376-5992
DOI:10.7717/PEERJ-CS.395