A Novel Quantum Genetic Algorithm in TSP

Hong Lv

doi:10.4028/www.scientific.net/AMM.519-520.759

Paper Titles

Trend Analysis of Product Function Using Sequential Pattern Mining
p.736

The Satellite Attitude Control Law Design Based on Machine Learning
p.741

A Novel Distributed Jointly Sparse Optimization Algorithm
p.747

A Research on Smart Tourism Service Mechanism Based on Context Awareness
p.752

A Novel Quantum Genetic Algorithm in TSP
p.759

Acoustic Articulatory of Uyghur Phonetics
p.764

Stability of Number-Processing Based on Information Granularity Associative with Parietal Cortex
p.769

Research on Intelligent Decision Method Based on Grey System Theory in the Prediction of Grain Yield in Jilin Province
p.775

Research on Level Effect-Based Fuzzy Prediction Method
p.780

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 519-520A Novel Quantum Genetic Algorithm in TSP

A Novel Quantum Genetic Algorithm in TSP

Abstract:

In this paper a novel quantum genetic algorithm (NQGA) introducing the crossover and mutation operations is proposed, and the algorithm is used to solve the TSP in MATLAB. Compared with the traditional Quantum genetic algorithm(QGA),NQGA is better in the global searching ability.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 519-520)

Pages:

759-763

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.519-520.759

Citation:

Cite this paper

Online since:

February 2014

Authors:

Hong Lv*

Keywords:

Genetic Algorithm (GA), Quantum Computation, Quantum Genetic Algorithm, TSP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Ankur Sharma, Vijay Maheshwari and Ratan Mishra: Population-Based Optimization Genetic Algorithm Approaches For Solving The Travelling Salesman Problem , IJERT, Vol. 2(2013).

Google Scholar

[2] Layeb Abdesslem, Meshoul Soham, Batouche Mohamed: Multiple Sequence Alignment by Quantum Genetic Algorithm, Parallel and Distributed Processing Symposium (2006).

DOI: 10.1109/ipdps.2006.1639617

Google Scholar

[3] P. W. Shor: Algorithms for Quantum Computation: Discrete Logarithms and Factoring, Annual Symposium on Foundations of Computer Science(1994).

DOI: 10.1109/sfcs.1994.365700

Google Scholar

[4] L. K. Grover: A fast quantum mechanical algorithm for database search, ACM Symposium on Theory of Computing, pp.212-219, (1996).

Google Scholar

[5] L. K. Grover: Quantum Mechanical Searching, Congress on Evolutionary Computation (1999).

Google Scholar

[6] Richard H. Warren: Adapting the traveling salesman problem to an adiabatic quantum computer, Quantum Inf Process (2013).

DOI: 10.1007/s11128-012-0490-8

Google Scholar

[7] Xinxin Ouyang, Yongquan Zhou, Qifang Luo and Huan Chen: A Novel Discrete Cuckoo Search Algorithm for Spherical Traveling Salesman Problem, Appl. Math. Inf. Sci (2013).

DOI: 10.12785/amis/070248

Google Scholar