The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Quantum-Inspired Evolutionary Algorithms With a New Termination Criterion,<tex>$H_epsilon $</tex>Gate, and Two-Phase Scheme
Abstract
From recent research on combinatorial optimization of the knapsack problem, quantum-inspired evolutionary algorithm (QEA) was proved to be better than conventional genetic algorithms. To improve the performance of the QEA, this paper proposes research issues on QEA such as a termination criterion, a Q-gate, and a two-phase scheme, for a class of numerical and combinatorial optimization problems. A new termination criterion is proposed which gives a clearer meaning on the convergence of Q-bit individuals. A novel variation operator H/sub /spl epsi// gate, which is a modified version of the rotation gate, is proposed along with a two-phase QEA scheme based on the analysis of the effect of changing the initial conditions of Q-bits of the Q-bit individual in the first phase. To demonstrate the effectiveness and applicability of the updated QEA, several experiments are carried out on a class of numerical and combinatorial optimization problems. The results show that the updated QEA makes QEA more powerful than the previous QEA in terms of convergence speed, fitness, and robustness.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Artificial intelligence: a modern approach
(1995) · Choice Reviews Online · doi:10.5860/choice.33-1577 · Cited by 21,974
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Artificial intelligence: A modern approach
Nilsson, N. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(96)00007-0 · Cited by 10,583
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
Han, K.-H., & Kim, J.-H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.804320 · Cited by 1,585
Self-citationQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Genetic Algorithms + Data Structures = Evolution Programs
Rocke, D. M., & Michalewicz, Z. (2000) · Journal of the American Statistical Association · doi:10.2307/2669583 · Cited by 880
Genetic quantum algorithm and its application to combinatorial optimization problem
Han, K.-H., & Kim, J.-H. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870809 · Cited by 664
Self-citationQuantum-inspired genetic algorithms
Narayanan, A., & Moore, M. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542334 · Cited by 649
On the power of quantum computation
Simon, D. R. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365701 · Cited by 491
What is evolutionary computation?
Fogel, D. B. (2000) · IEEE Spectrum · doi:10.1109/6.819926 · Cited by 275
Explorations in Quantum Computing
Williams, C. P. (2011) · Texts in Computer Science · doi:10.1007/978-1-84628-887-6 · Cited by 274
Explorations in Quantum Computing
Williams, C. P., & Bennett, C. (1999) · Physics Today · doi:10.1063/1.882526 · Cited by 248
Parallel quantum-inspired genetic algorithm for combinatorial optimization problem
Han, K.-H., Park, K.-H., Lee, C.-H., & Kim, J.-H. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934358 · Cited by 190
Self-citationExplorations in quantum computing
de Wolf, R. (1998) · Science of Computer Programming · doi:10.1016/s0167-6423(98)90002-8 · Cited by 120
Finding a better-than-classical quantum AND/OR algorithm using genetic programming
Spector, L. C., Barnum, H., Bernstein, H. J., & Swamy, N. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.785553 · Cited by 116
On setting the parameters of quantum-inspired evolutionary algorithm for practical application
Han, K.-H., & Kim, J.-H. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299572 · Cited by 79
Self-citationEvolving quantum circuits using genetic algorithm
Lukac, M., & Perkowski, M. A. (2003) · NASA/DoD Conference on Evolvable Hardware · doi:10.1109/eh.2002.1029883 · Cited by 77
Evolving quantum circuits using genetic programming
Rubinstein, B. I. P. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2001.934383 · Cited by 64
Quantum-Inspired Evolutionary Algorithm-Based Face Verification
Jang, J.-S., Han, K.-H., & Kim, J.-H. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45110-2_110 · Cited by 41
Self-citation(1998) · doi:10.4171/dms/1-1/16 · Cited by 34
Greenwood, G. W. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2001.934274 · Cited by 32
Cited by
Quantum-inspired evolutionary algorithms: a survey and empirical study
Zhang, G. (2011) · Journal of Heuristics · doi:10.1007/s10732-010-9136-0 · Cited by 295
Quantum multiverse optimization algorithm for optimization problems
Sayed, G. I., Darwish, A., & Hassanien, A. E. (2019) · Neural Computing and Applications · doi:10.1007/s00521-017-3228-9 · Cited by 72
A hybrid quantum feature selection algorithm using a quantum inspired graph theoretic approach
Chakraborty, S., Shaikh, S. H., Chakrabarti, A., & Ghosh, R. (2020) · Applied Intelligence · doi:10.1007/s10489-019-01604-3 · Cited by 51
Metadata
- Authors
- Han, K.-H., & Kim, J.-H.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2004-04
- Volume
- 8
- Issue
- 2
- Pages
- 156-169
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2136885049
- Cited by
- 482
- References
- 35
- FWCI
- 13.90
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.