ABSTRACT
We propose a numeric variant of quantum-inspired evolutionary algorithm (QIEA) where gene in the quantum chromosome is a superposition of k qubits, thus allowing the genes of the classical chromosome to take numeric values. We also present a modified form of real observation QIEA. Both these techniques are applied to the problem of partitioning a complex network. The algorithm parameters are tuned using an evolutionary bilevel search optimization technique.
- L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment, 2005(09):P09008, 2005.Google ScholarCross Ref
- K. Deb and A. Sinha. Solving bilevel multi-objective optimization problems using evolutionary algorithms. In Evolutionary Multi-Criterion Optimization, pages 110--124. Springer, 2009. Google ScholarDigital Library
- K.-H. Han and J.-H. Kim. Genetic quantum algorithm and its application to combinatorial optimization problem. In Evolutionary Computation, 2000. Proceedings of the 2000 Congress on, volume 2, pages 1354--1360. IEEE, 2000.Google Scholar
- E. A. Leicht and M. E. Newman. Community structure in directed networks. Physical review letters, 100(11):118703, 2008.Google Scholar
- D. Lusseau. The emergent properties of a dolphin social network. Proceedings of the Royal Society of London. Series B: Biological Sciences, 270(Suppl 2):S186--S188, 2003.Google Scholar
- M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review, E 69(026113), 2004.Google Scholar
- G. Ochoa. Error thresholds and optimal mutation rates in genetic algorithms. PhD thesis, 2000.Google Scholar
- A. Seshadri. Nsga - ii: A multi-objective optimization algorithm, July 2009.Google Scholar
- M. Tasgin and H. Bingol. Community detection in complex networks using genetic algorithm. In ECCS '06: Proc. of the European Conference on Complex Systems, Apr. 2006.Google Scholar
- L. Wang, H. Wu, F. Tang, and D.-Z. Zheng. A hybrid quantum-inspired genetic algorithm for flow shop scheduling. In Advances in Intelligent Computing, pages 636--644. Springer, 2005. Google ScholarDigital Library
- W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of anthropological research, pages 452--473, 1977.Google Scholar
- G. Zhang. Quantum-inspired evolutionary algorithms: a survey and empirical study. Journal of Heuristics, 17(3):303--351, 2011. Google ScholarDigital Library
Index Terms
- Parameter tuning in quantum-inspired evolutionary algorithms for partitioning complex networks
Recommendations
Quantum-inspired evolutionary multicast algorithm
SMC'09: Proceedings of the 2009 IEEE international conference on Systems, Man and CyberneticsAs a global optimizing algorithm, genetic algorithm (GA) is applied to solve the problem of multicast more and more. GA has more powerful searching ability than traditional algorithm, however its property of "prematurity" makes it difficult to get a ...
Towards the right amount of randomness in quantum-inspired evolutionary algorithms
Quantum-inspired evolutionary algorithms (QIEAs) combine the advantages of quantum-inspired bit (Q-bit), representation and operators with evolutionary algorithms for better performance. Using quantum-inspired representation the complete binary search ...
Quantum-inspired evolutionary algorithms: a survey and empirical study
Quantum-inspired evolutionary algorithms, one of the three main research areas related to the complex interaction between quantum computing and evolutionary algorithms, are receiving renewed attention. A quantum-inspired evolutionary algorithm is a new ...
Comments