An Improved Immune Algorithm for Solving TSP Problem

被引：0
|
作者：
Xue, Hongquan [1 ,2 ]
Wei, Shengmin [1 ,2 ]
Yang, Lin [3 ]
机构：
[1] Northwest Polytech Univ, Sch Mech Engn, Xian 710072, Peoples R China
[2] Xian Univ Technol, Sch Econ & Management, Xian 710048, Peoples R China
[3] Xian Technol Univ, Xian 710032, Peoples R China
来源：
AUTOMATION EQUIPMENT AND SYSTEMS, PTS 1-4 | 2012年 / 468-471卷
关键词：
TSP problem; quantum optimization; immune optimization; improved immune algorithm; MULTIOBJECTIVE OPTIMIZATION;
D O I：
10.4028/www.scientific.net/AMR.468-471.678
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Immune algorithm is a set of computational systems inspired by the defense process of the biological immune system, and is widespread used in the combinatorial optimization problems. This paper describes an improved immune algorithm to solve the combinatorial optimization problems. The TSP problem is a typical application of the combinatorial optimization problems. The improved immune algorithm which based on the quantum principles is proposed for finding the optimal solutions to solve the TSP problem. In process of solving TSP problem, the quantum concept is used in initializing a population of quantum bit chromosomes. In the antibody's updating, the general quantum rotation gate strategy and the dynamic adjusting angle mechanism are applied to accelerate convergence.According to the analysis of the experiment, the algorithm is not only feasible but also effective to solve TSP problem. It effectively relieves some disadvantages of the quantum and immune optimization.
引用
收藏
页码：678 / +
页数：2
相关论文
共 50 条
  • [31] An improved algorithm for solving the Weber location problem
    Drezner, Zvi
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2024,
  • [32] Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
    Guo Pan
    Kenli Li
    Aijia Ouyang
    Keqin Li
    [J]. Soft Computing, 2016, 20 : 555 - 566
  • [33] Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
    Pan, Guo
    Li, Kenli
    Ouyang, Aijia
    Li, Keqin
    [J]. SOFT COMPUTING, 2016, 20 (02) : 555 - 566
  • [34] An Improved PSO-ACO Algorithm for Solving Large-Scale TSP
    Ouyang, Aijia
    Zhou, Yongquan
    [J]. SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 : 1154 - 1158
  • [35] Solving TSP Based On the Improved Simulated Annealing Algorithm with Sequential Access Restrictions
    Xiong, Lin
    Li, Shunxin
    [J]. PROCEEDINGS OF THE 2016 6TH INTERNATIONAL CONFERENCE ON MECHATRONICS, COMPUTER AND EDUCATION INFORMATIONIZATION (MCEI 2016), 2016, 130 : 610 - 616
  • [36] An Optimized Discrete Dragonfly Algorithm Tackling the Low Exploitation Problem for Solving TSP
    Emambocus, Bibi Aamirah Shafaa
    Jasser, Muhammed Basheer
    Amphawan, Angela
    Mohamed, Ali Wagdy
    [J]. MATHEMATICS, 2022, 10 (19)
  • [37] An improvement of the ant colony optimization algorithm for solving Travelling Salesman Problem (TSP)
    Li, Tiankun
    Chen, Wanzhong
    Zheng, Xin
    Zhang, Zhuo
    [J]. 2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 3931 - 3933
  • [38] An Improved Immune Genetic Algorithm for Solving the Flexible Job Shop Scheduling Problem with Batch Processing
    Song, Libo
    Liu, Chang
    Shi, Haibo
    Zhu, Jun
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2022, 2022
  • [39] An Improved Immune Genetic Algorithm for Solving the Packing Problem in the Hull Construction Automatic Packing System
    Mei Ying
    Zhu Liangsheng
    Ye Jiawei
    [J]. IITAW: 2009 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATIONS WORKSHOPS, 2009, : 464 - 467
  • [40] An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem
    Wang, Anbang
    Guo, Lihong
    Chen, Yuan
    Wang, Junjie
    Liu, Luo
    Song, Yuanzhang
    [J]. International Journal of Cognitive Informatics and Natural Intelligence, 2021, 15 (04)
12345