Improved quantum ant colony algorithm for solving TSP problem

Ying Ma, Wei Jian Tian, Yang Yu Fan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

For the low efficiency and poor performance of the ant colony algorithm in solving TSP problems, a new quantum ant colony algorithm proposed. The models of probability selection and pheromone are redefined, integrated with the quantum information intensity factor; The factor updated by quantum rotating gate according to iteration process; Some important parameters are self-adapted controlled at the same time; And 3-opt is used to further local optimization. Stimulation shows the performance is greatly improved.

Original languageEnglish
Title of host publicationProceedings - 2014 IEEE Workshop on Electronics, Computer and Applications, IWECA 2014
PublisherIEEE Computer Society
Pages453-456
Number of pages4
ISBN (Print)9781479945658
DOIs
StatePublished - 2014
Event2014 IEEE Workshop on Electronics, Computer and Applications, IWECA 2014 - Ottawa, ON, Canada
Duration: 8 May 20149 May 2014

Publication series

NameProceedings - 2014 IEEE Workshop on Electronics, Computer and Applications, IWECA 2014

Conference

Conference2014 IEEE Workshop on Electronics, Computer and Applications, IWECA 2014
Country/TerritoryCanada
CityOttawa, ON
Period8/05/149/05/14

Keywords

  • quantum ant colony algorithm
  • quantum computing
  • quantum evolution
  • TSP

Fingerprint

Dive into the research topics of 'Improved quantum ant colony algorithm for solving TSP problem'. Together they form a unique fingerprint.

Cite this