The Prasatul Matrix (L-Matrix) is prepared by directly comparing the optimal solutions of two optimization algorithms.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Prasatul Matrix
The Prasatul Matrix is prepared by directly comparing the solutions produced by two optimization algorithms for r numbers of trials. It has three levels of abstractions both in rows and columns.
Instruction
For quality comparision, you can simply use best values obtained with two evolutionary optimization algorithms on r runs.
For convergence comparison, you can use best values obtained with two evolutionary optimization algorithms in i itarations on a single run (or if r runs are considered then take iteration-wise average).
For solution quality, an example with solutions obtained by SCA and WOA on CEC 2005 f5 in dimension 20 over 50 runs are given. You just need to replace the csv files of any pair of algorithms to generate LMatrix (Prasatul Matrix) and D-scores and K-scores.
Preprint
Anupam Biswas. 2022. Prasatul Matrix: A Direct Comparison Approach for Analyzing Evolutionary Optimization Algorithms . arXiv. https://arxiv.org/abs/2212.00671
Citation
@misc{biswas2022prasatul,
title={Prasatul Matrix: A Direct Comparison Approach for Analyzing Evolutionary Optimization Algorithms},
author={Anupam Biswas},
year={2022},
eprint={2212.00671},
archivePrefix={arXiv},
primaryClass={cs.NE}
}
Cite As
Anupam Biswas (2026). Prasatul Matrix (https://github.com/anupambis/Prasatul), GitHub. Retrieved .
General Information
- Version 1.0.1 (15.8 KB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
Versions that use the GitHub default branch cannot be downloaded
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.1 | Nil |
||
| 1.0.0 |
