Dynamic Quantum Crossover Based Clonal Selection Algorithm For Solving Traveling Salesman Problem

Hongwei Dai; Yang Yu; Cunhua Li

doi:10.4156/aiss.vol3.issue11.25

ScienceGate Book Chapters

JOURNAL ARTICLE

Dynamic Quantum Crossover Based Clonal Selection Algorithm For Solving Traveling Salesman Problem

Hongwei Dai Yang Yu Cunhua Li

Year: 2011 Journal: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences Vol: 3 (11)Pages: 200-207

DOI: 10.4156/aiss.vol3.issue11.25

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Crossover Selection (genetic algorithm) 2-opt Computer science Clonal selection algorithm Mathematical optimization Algorithm Quantum Bottleneck traveling salesman problem Mathematics Artificial intelligence Physics

Metrics

Cited By

0.78

FWCI (Field Weighted Citation Impact)

Refs

0.81

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Artificial Immune Systems Applications

Physical Sciences → Engineering → Biomedical Engineering

Quantum Computing Algorithms and Architecture

Physical Sciences → Computer Science → Artificial Intelligence

Dynamic Quantum Crossover Based Clonal Selection Algorithm For Solving Traveling Salesman Problem

Metrics

Citation History

Topics

Related Documents

Quantum Interference Crossover-Based Clonal Selection Algorithm and Its Application to Traveling Salesman Problem

Stochastic Compact Quantum Crossover Based Clonal Selection Algorithm for Traveling Salesman Problems

Improved Quantum Crossover Based Genetic Algorithm For Solving Traveling Salesman Problem

Dynamic Algorithm for Solving the Traveling Salesman Problem

Solving Dynamic Traveling Salesman Problem