A simple quantum-inspired bee colony algorithm for discrete optimisation problems
by Hongyuan Gao; Chenwan Li; Wen Cui
International Journal of Computer Applications in Technology (IJCAT), Vol. 46, No. 3, 2013

Abstract: To design a novel intelligence algorithm for discrete optimisation problem, a simple quantum-inspired bee colony algorithm (SQBCA) is proposed. The proposed SQBCA applies the quantum computing theory to bee colony optimisation (BCO), which is an effective discrete optimisation algorithm. Then the proposed simple quantum-inspired bee colony algorithm is used to solve benchmark functions and multiuser detection problems of code division multiple access (CDMA) system. By hybridising the bee colony optimisation and quantum computing theory, the quantum state and binary state of the quantum bees can be well evolved by simulated quantum rotation gate and simulated quantum not gate. The new robust multiuser detection based on SQBCA can search the global optimal solution. Simulation results for CDMA systems are provided to show that the proposed robust multiuser detection method is superior to the multiuser detection based on previous intelligence algorithms.

Online publication date: Wed, 29-May-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com