By Topic

A new quantum-inspired genetic algorithm for solving the travelling salesman problem

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
$33 $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)
H. Talbi ; USI Emir Abdelkader, Constantine, Algeria ; A. Draa ; M. Batouche

This paper presents a new algorithm for solving the travelling salesman problem (TSP). The TSP is one of the most known combinatorial optimisation problems. It is about finding the shortest Hamiltonian cycle relating N cities. The algorithm is inspired from both genetic algorithms and quantum computing fields. It extends the standard genetic algorithms by combining them to some concepts and principles provided from quantum computing field such as quantum bit, states superposition and interference. The obtained results from the application of the proposed algorithm on some instances of TSP are significantly better than those provided by standard genetic algorithms.

Published in:

Industrial Technology, 2004. IEEE ICIT '04. 2004 IEEE International Conference on  (Volume:3 )

Date of Conference:

8-10 Dec. 2004