An Improve Cuckoo Search Algorithm for Traveling Salesman Problems

被引：1
|
作者：
Lengzhi, Suonan [1 ]
Li, Yueguang [1 ]
机构：
[1] Gansu Normal Univ Nationalities, Hezuo 747000, Gansu, Peoples R China
来源：
MATERIAL SCIENCE, CIVIL ENGINEERING AND ARCHITECTURE SCIENCE, MECHANICAL ENGINEERING AND MANUFACTURING TECHNOLOGY II | 2014年 / 651-653卷
关键词：
Cuckoo Search Algorithm; TSP; Intelligent algorithm; ant colony algorithm;
D O I：
10.4028/www.scientific.net/AMM.651-653.2291
中图分类号：
TU [建筑科学];
学科分类号：
0813 ;
摘要：
In this paper, according to the characteristics of TSP. An improve Cuckoo Search Algorithm was used to solve the TSP, adopting the code rule of randomized key representation based on the smallest position value. The experimental results show that the new algorithm is successful in locating multiple solutions and has better accuracy, simulation results of benchmark instances validate the efficiency and superiority of Cuckoo Search Algorithm.
引用
收藏
页码：2291 / 2295
页数：5
相关论文
共 50 条
  • [31] Discrete sparrow search algorithm for symmetric traveling salesman problem
    Zhang, Zhen
    Han, Yang
    APPLIED SOFT COMPUTING, 2022, 118
  • [32] A Binary Cuckoo Search Algorithm for Knapsack Problems
    Bhattacharjee, Kaushik Kumar
    Sarmah, Sarada Prasad
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT (IEOM), 2015,
  • [33] A multiple heuristic search algorithm for solving traveling salesman problem
    Gang, P
    Iimura, I
    Nakayama, S
    PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 779 - 783
  • [34] A survey on cuckoo search algorithm for optimization problems
    Verma, Himanshu
    Kumar, Yogendra
    TechRxiv, 2021,
  • [35] Glassy dynamics in local search by metropolis algorithm: Temperature-cycling experiments on traveling salesman problems
    Hasegawa, M.
    Flow Dynamics, 2006, 832 : 578 - 581
  • [36] Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: Preliminary Study on the Traveling Salesman Problem
    Osaba, Eneko
    Villar-Rodriguez, Esther
    Oregi, Izaskun
    Moreno-Fernandez-de-Leceta, Aitor
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 351 - 358
  • [37] Discrete artificial firefly algorithm for solving traveling salesman problems
    Yu, Hong-Tao
    Goo, Li-Qun
    Han, Xi-Chang
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2015, 43 (01): : 126 - 131
  • [38] Nonexistence of a Universal Algorithm for Traveling Salesman Problems in Constructive Mathematics
    Dai, Linglong
    INTELLIGENT COMPUTING, VOL 1, 2022, 506 : 889 - 895
  • [39] A membrane-inspired approximate algorithm for traveling salesman problems
    Zhang, Gexiang
    Cheng, Jixiang
    Gheorghe, Marian
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2011, 14 (01): : 3 - 19
  • [40] Hybrid chromosome genetic algorithm for generalized traveling salesman problems
    Huang, H
    Yang, XW
    Hao, ZF
    Wu, CG
    Liang, YC
    Zha, X
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 137 - 140
12345