Abstract

This work aims to accelerate metaheuristic optimization algorithms and their experimental environment using the vectorization feature in the NumPy library in Python. It is built upon EvoloPy, a framework previously introduced by Faris et al. (2016)[41] for metaheuristic optimization in Python. We have vectorized every aspect of this framework including function evaluation, random number sampling, strategy selection, and performing the update equations. We compare the wall-clock time of our vectorized framework for a few algorithms with the original implementation in EvoloPy. The results demonstrate the substantial improvement in the algorithm’s execution time, even to three orders of magnitude in cases like a 180-dimensional search space. The codes can be found at https://github.com/BaratiLab/VecMetaPy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.