By Topic

Quantum computing-based Ant Colony Optimization algorithm for TSP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaoming You ; Coll. of Electron. & Electr. Eng., Shanghai Univ. of Eng. Sci., Shanghai, China ; Xingwai Miao ; Sheng Liu

A novel self-adaptive Ant Colony Optimization algorithm based on Quantum mechanism for Traveling salesman problem(TQACO) is proposed. Firstly, initializing the population of the ant colony with superposition of Q-bit, Secondly, using self-adaptive operator, namely in prophase we use higher probability to explore more search space and to collect useful global information; otherwise in anaphase we use higher probability to accelerate convergence. This mechanism offers the ability to escape from local optima and can self-regulate the production of diverse antibodies. Because of the quantum superposition and rotation it can maintain quite nicely the population diversity than the classical evolutionary algorithm, because of the self-adaptive operator it can obtain more optimal solution and the solution quality is improved significantly. TSP benchmark instances Chn144 results demonstrate the superiority of TQACO in this paper.

Published in:

Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on  (Volume:3 )

Date of Conference:

19-20 Dec. 2009