Group leaders optimization algorithm

Anmer Daskin, Sabre Kais

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the method, a standard suite of single and multi-dimensional optimization functions along with the energies and the geometric structures of Lennard-Jones clusters are given as well as the application of the algorithm on quantum circuit design problems. We show that as an improvement over previous methods, the algorithm scales as N2.5 for the Lennard-Jones clusters of N-particles. In addition, an efficient circuit design is shown for a two-qubit Grover search algorithm which is a quantum algorithm providing quadratic speedup over the classical counterpart.

Original languageEnglish
Pages (from-to)761-772
Number of pages12
JournalMolecular Physics
Volume109
Issue number5
DOIs
Publication statusPublished - 10 Mar 2011
Externally publishedYes

Fingerprint

optimization
inspiration
Networks (circuits)
Global optimization
energy

Keywords

  • evolutionary algorithms
  • Lennard-Jones clusters
  • optimization
  • quantum circuits

ASJC Scopus subject areas

  • Physical and Theoretical Chemistry
  • Condensed Matter Physics
  • Biophysics
  • Molecular Biology

Cite this

Group leaders optimization algorithm. / Daskin, Anmer; Kais, Sabre.

In: Molecular Physics, Vol. 109, No. 5, 10.03.2011, p. 761-772.

Research output: Contribution to journalArticle

Daskin, Anmer ; Kais, Sabre. / Group leaders optimization algorithm. In: Molecular Physics. 2011 ; Vol. 109, No. 5. pp. 761-772.
@article{5381dd33a1104be79eac6fa32805c68f,
title = "Group leaders optimization algorithm",
abstract = "We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the method, a standard suite of single and multi-dimensional optimization functions along with the energies and the geometric structures of Lennard-Jones clusters are given as well as the application of the algorithm on quantum circuit design problems. We show that as an improvement over previous methods, the algorithm scales as N2.5 for the Lennard-Jones clusters of N-particles. In addition, an efficient circuit design is shown for a two-qubit Grover search algorithm which is a quantum algorithm providing quadratic speedup over the classical counterpart.",
keywords = "evolutionary algorithms, Lennard-Jones clusters, optimization, quantum circuits",
author = "Anmer Daskin and Sabre Kais",
year = "2011",
month = "3",
day = "10",
doi = "10.1080/00268976.2011.552444",
language = "English",
volume = "109",
pages = "761--772",
journal = "Molecular Physics",
issn = "0026-8976",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - Group leaders optimization algorithm

AU - Daskin, Anmer

AU - Kais, Sabre

PY - 2011/3/10

Y1 - 2011/3/10

N2 - We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the method, a standard suite of single and multi-dimensional optimization functions along with the energies and the geometric structures of Lennard-Jones clusters are given as well as the application of the algorithm on quantum circuit design problems. We show that as an improvement over previous methods, the algorithm scales as N2.5 for the Lennard-Jones clusters of N-particles. In addition, an efficient circuit design is shown for a two-qubit Grover search algorithm which is a quantum algorithm providing quadratic speedup over the classical counterpart.

AB - We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the method, a standard suite of single and multi-dimensional optimization functions along with the energies and the geometric structures of Lennard-Jones clusters are given as well as the application of the algorithm on quantum circuit design problems. We show that as an improvement over previous methods, the algorithm scales as N2.5 for the Lennard-Jones clusters of N-particles. In addition, an efficient circuit design is shown for a two-qubit Grover search algorithm which is a quantum algorithm providing quadratic speedup over the classical counterpart.

KW - evolutionary algorithms

KW - Lennard-Jones clusters

KW - optimization

KW - quantum circuits

UR - http://www.scopus.com/inward/record.url?scp=79952645832&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952645832&partnerID=8YFLogxK

U2 - 10.1080/00268976.2011.552444

DO - 10.1080/00268976.2011.552444

M3 - Article

AN - SCOPUS:79952645832

VL - 109

SP - 761

EP - 772

JO - Molecular Physics

JF - Molecular Physics

SN - 0026-8976

IS - 5

ER -