Bahig, H.M.; Hazber, M.A.G.; Bahig, H.M. An Efficient Simulated Annealing Algorithm for Short Addition Sequences. AIMS Mathematics 2024, 9, 11024–11038, doi:10.3934/math.2024540.
Bahig, H.M.; Hazber, M.A.G.; Bahig, H.M. An Efficient Simulated Annealing Algorithm for Short Addition Sequences. AIMS Mathematics 2024, 9, 11024–11038, doi:10.3934/math.2024540.
Bahig, H.M.; Hazber, M.A.G.; Bahig, H.M. An Efficient Simulated Annealing Algorithm for Short Addition Sequences. AIMS Mathematics 2024, 9, 11024–11038, doi:10.3934/math.2024540.
Bahig, H.M.; Hazber, M.A.G.; Bahig, H.M. An Efficient Simulated Annealing Algorithm for Short Addition Sequences. AIMS Mathematics 2024, 9, 11024–11038, doi:10.3934/math.2024540.
Abstract
An addition sequence is an important operation in many applications of computer science, such as multi-modular exponentiation and outsourcing protocols. Finding an addition sequence for a set of positive integers with the shortest length is challenging due to the high computational time required to find the solution. In this paper, a new metaheuristic algorithm is designed based on the simulated annealing strategy to generate a short addition sequence. The efficiency of the proposed algorithm was proved experimentally by comparing it with the previous exact and heuristic algorithms in terms of running time and the length of the addition sequence.
Computer Science and Mathematics, Computer Science
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
