Abstract
A quantum-inspired evolutionary algorithm (QEA) is proposed as a stochastic algorithm to perform combinatorial optimization problems. The QEA is evolutionary computation that uses quantum bits and superposition states in quantum computation. Although the QEA is a coarse-grained parallel algorithm, it involves many parameters that must be adjusted manually. This paper proposes a new method, named pair swap, which exchanges each best solution information between two individuals instead of migration in the QEA. Experimental results show that our proposed method is a simpler algorithm and can find a high quality solution in the 0-1 knapsack problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Nielsen MA, Chuang IL (2000) Quantum computation and quantum information. Cambridge University Press, New York
Nakayama S (2005) Consideration on the square-root gates of quantum logic gates (in Japanese). Trans Jpn Soc Comput Eng Sci 7:77–82
Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. Proceedings of the IEEE International Conference on Evolutionary Computation, Nagoya, Japan, IEEE Press, USA, pp 61–66
Nakayama S, Iimura I, Ito T (2005) Consideration on quantum interference crossover method in immune algorithm (in Japanese). IEICE Trans Inf Syst PT.1 (Japanese ed) J-88-D-I (12):1795–1799
Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evolut Comput 6:580–593
Han KH, Kim JH (2003) On setting the parameters of QEA for practical applications: some guidelines based on empirical evidence. Genet Evolut Comput (GECCO 2003), pp 427–428
Kirkpatric S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):45–54
Belding TC (1995) The distributed genetic algorithm revisited. Proceedings of the Sixth International Conference on Genetic Algorithms, Pittsburgh, USA, Morgan Kaufmann Publishers, USA, pp 114–121
Iimura I, Ikehata S, Nakayama S (2003) Consideration on Noah’s ark strategy in a parallel genetic algorithm with object-shared space (in Japanese). J Jpn Soc Inf Knowledge 13(2):1–7
Nakayama S, Imabeppu T, Ono S, et al. (2006) Consideration on pair swap strategy in quantum-inspired evolutionary algorithm (in Japanese). IEICE Trans Inf Syst PT.1 (Japanese ed) J89-D-I (9):2134–2139
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Imabeppu, T., Nakayama, S. & Ono, S. A study on a quantum-inspired evolutionary algorithm based on pair swap. Artif Life Robotics 12, 148–152 (2008). https://doi.org/10.1007/s10015-007-0457-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-007-0457-5