Quantum-Inspired Acromyrmex Evolutionary Algorithm

Obtaining efficient optimisation algorithms has become the focus of much research interest since current developing trends in machine learning, traffic management, and other cutting-edge applications require complex optimised models containing a huge number of parameters. At present, computers based...

Full description

Saved in:
Bibliographic Details
Published inScientific reports Vol. 9; no. 1; pp. 12181 - 10
Main Authors Montiel, Oscar, Rubio, Yoshio, Olvera, Cynthia, Rivera, Ajelet
Format Journal Article
LanguageEnglish
Published London Nature Publishing Group UK 21.08.2019
Nature Publishing Group
Subjects
Online AccessGet full text
ISSN2045-2322
2045-2322
DOI10.1038/s41598-019-48409-5

Cover

More Information
Summary:Obtaining efficient optimisation algorithms has become the focus of much research interest since current developing trends in machine learning, traffic management, and other cutting-edge applications require complex optimised models containing a huge number of parameters. At present, computers based on the classical Turing-machine are inefficient when intent to solve optimisation tasks in complex and wicked problems. As a solution, quantum computers that should satisfy the Deutsch-Church-Turing principle have been proposed but this technology is still at an early stage. quantum-inspired algorithms (QIA) have emerged trying to fill-up an existing gap between the theoretical advances in quantum computation and real quantum computers. QIA use classical computers to simulate some physical phenomena such as superposition and entanglement to perform quantum computations. This paper proposes the quantum-inspired Acromyrmex evolutionary algorithm (QIAEA) as a highly efficient global optimisation method for complex systems. We present comparative statistical analyses that demonstrate how this nature-inspired proposal outperforms existing outstanding quantum-inspired evolutionary algorithms when testing benchmark functions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-019-48409-5