Multi-update mode quantum evolutionary algorithm for a combinatorial problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

This paper proposed a new evolutionary algorithm based on concept and principles of quantum computing, called Multi-update Mode Quantum Evolution Algorithm (MMQEA), in which having two update modes á-update and β-update, and between their modes each update procedure provide its evolutionary information to other one, that to guide the other update-mode to maintain the population diversity and avoid premature. Meanwhile in MMQEA, proposed a new individual structure that composed by two Q-bit strings. Applying the multi-update mode to individual evolution improved the Q-gate updating efficiency in each generation of MMQEA. To demonstrate its effectiveness and applicability, the proposed algorithms were tested on a famous combinatorial optimization problem, the knapsack problem. The results show that MMQEA performs very well compared with Quantum Evolutionary Algorithm (QEA).

Original languageEnglish
Title of host publication2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010
Pages281-285
Number of pages5
Volume2
DOIs
Publication statusPublished - 2010
Event2nd International Conference on Computer and Automation Engineering, ICCAE 2010 - Singapore
Duration: 2010 Feb 262010 Feb 28

Other

Other2nd International Conference on Computer and Automation Engineering, ICCAE 2010
CitySingapore
Period10/2/2610/2/28

Fingerprint

Evolutionary algorithms
Combinatorial optimization

Keywords

  • Combinatorial optimization
  • Knapsack problem
  • Multil-update mode
  • Q-bit
  • Q-bit chromosome
  • Q-gate
  • Quantum evolutionary algorithm (QEA)

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Control and Systems Engineering

Cite this

Xin, W., & Fujimura, S. (2010). Multi-update mode quantum evolutionary algorithm for a combinatorial problem. In 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010 (Vol. 2, pp. 281-285). [5451502] https://doi.org/10.1109/ICCAE.2010.5451502

Multi-update mode quantum evolutionary algorithm for a combinatorial problem. / Xin, Wei; Fujimura, Shigeru.

2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. Vol. 2 2010. p. 281-285 5451502.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xin, W & Fujimura, S 2010, Multi-update mode quantum evolutionary algorithm for a combinatorial problem. in 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. vol. 2, 5451502, pp. 281-285, 2nd International Conference on Computer and Automation Engineering, ICCAE 2010, Singapore, 10/2/26. https://doi.org/10.1109/ICCAE.2010.5451502
Xin W, Fujimura S. Multi-update mode quantum evolutionary algorithm for a combinatorial problem. In 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. Vol. 2. 2010. p. 281-285. 5451502 https://doi.org/10.1109/ICCAE.2010.5451502
Xin, Wei ; Fujimura, Shigeru. / Multi-update mode quantum evolutionary algorithm for a combinatorial problem. 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010. Vol. 2 2010. pp. 281-285
@inproceedings{785dbfd5d16540b1ba69dd8b26163863,
title = "Multi-update mode quantum evolutionary algorithm for a combinatorial problem",
abstract = "This paper proposed a new evolutionary algorithm based on concept and principles of quantum computing, called Multi-update Mode Quantum Evolution Algorithm (MMQEA), in which having two update modes {\'a}-update and β-update, and between their modes each update procedure provide its evolutionary information to other one, that to guide the other update-mode to maintain the population diversity and avoid premature. Meanwhile in MMQEA, proposed a new individual structure that composed by two Q-bit strings. Applying the multi-update mode to individual evolution improved the Q-gate updating efficiency in each generation of MMQEA. To demonstrate its effectiveness and applicability, the proposed algorithms were tested on a famous combinatorial optimization problem, the knapsack problem. The results show that MMQEA performs very well compared with Quantum Evolutionary Algorithm (QEA).",
keywords = "Combinatorial optimization, Knapsack problem, Multil-update mode, Q-bit, Q-bit chromosome, Q-gate, Quantum evolutionary algorithm (QEA)",
author = "Wei Xin and Shigeru Fujimura",
year = "2010",
doi = "10.1109/ICCAE.2010.5451502",
language = "English",
isbn = "9781424455850",
volume = "2",
pages = "281--285",
booktitle = "2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010",

}

TY - GEN

T1 - Multi-update mode quantum evolutionary algorithm for a combinatorial problem

AU - Xin, Wei

AU - Fujimura, Shigeru

PY - 2010

Y1 - 2010

N2 - This paper proposed a new evolutionary algorithm based on concept and principles of quantum computing, called Multi-update Mode Quantum Evolution Algorithm (MMQEA), in which having two update modes á-update and β-update, and between their modes each update procedure provide its evolutionary information to other one, that to guide the other update-mode to maintain the population diversity and avoid premature. Meanwhile in MMQEA, proposed a new individual structure that composed by two Q-bit strings. Applying the multi-update mode to individual evolution improved the Q-gate updating efficiency in each generation of MMQEA. To demonstrate its effectiveness and applicability, the proposed algorithms were tested on a famous combinatorial optimization problem, the knapsack problem. The results show that MMQEA performs very well compared with Quantum Evolutionary Algorithm (QEA).

AB - This paper proposed a new evolutionary algorithm based on concept and principles of quantum computing, called Multi-update Mode Quantum Evolution Algorithm (MMQEA), in which having two update modes á-update and β-update, and between their modes each update procedure provide its evolutionary information to other one, that to guide the other update-mode to maintain the population diversity and avoid premature. Meanwhile in MMQEA, proposed a new individual structure that composed by two Q-bit strings. Applying the multi-update mode to individual evolution improved the Q-gate updating efficiency in each generation of MMQEA. To demonstrate its effectiveness and applicability, the proposed algorithms were tested on a famous combinatorial optimization problem, the knapsack problem. The results show that MMQEA performs very well compared with Quantum Evolutionary Algorithm (QEA).

KW - Combinatorial optimization

KW - Knapsack problem

KW - Multil-update mode

KW - Q-bit

KW - Q-bit chromosome

KW - Q-gate

KW - Quantum evolutionary algorithm (QEA)

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

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

U2 - 10.1109/ICCAE.2010.5451502

DO - 10.1109/ICCAE.2010.5451502

M3 - Conference contribution

SN - 9781424455850

VL - 2

SP - 281

EP - 285

BT - 2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010

ER -