Studying Informational Sensitivity of Computer Algorithm Solving TSP

被引：0
|
作者：
Kiktenko, A. A. [1 ]
Nikiforov, K. A. [1 ]
机构：
[1] St Peterburg State Univ, St Petersburg 199034, Russia
来源：
2014 INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGIES IN PHYSICAL AND ENGINEERING APPLICATIONS (ICCTPEA) | 2014年
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The purpose of this work is to obtain an estimate of the statistical measures of informational sensitivity for Concorde algorithm and the establishment of mean values and confidence intervals of the complexity for different sizes of input data. The result is that the algorithm and its implementation are highly sensitive to the input data.
引用
收藏
页码：73 / 73
页数：1
相关论文
共 50 条
  • [41] Solving TSP by using combinatorial Bees algorithm with nearest neighbor method
    Murat Sahin
    Neural Computing and Applications, 2023, 35 : 1863 - 1879
  • [42] Solving TSP by using combinatorial Bees algorithm with nearest neighbor method
    Sahin, Murat
    NEURAL COMPUTING & APPLICATIONS, 2023, 35 (02): : 1863 - 1879
  • [43] Solving TSP Problem in Cloud Computing using Improved Cultural Algorithm
    Azarkasb, Seyed Omid
    Khasteh, Seyed Hossein
    Kashi, Saeed Sedighian
    2021 26TH INTERNATIONAL COMPUTER CONFERENCE, COMPUTER SOCIETY OF IRAN (CSICC), 2021,
  • [44] Software for solving of TSP
    Lukatsky, Roman
    Rybinkin, Vladimir
    PROCEEDINGS OF THE 11TH WSEAS INTERNATIONAL CONFERENCE ON SYSTEMS, VOL 2: SYSTEMS THEORY AND APPLICATIONS, 2007, : 442 - +
  • [45] New algorithm for solving TSP based on dots and lines loop optimizing
    Gu, Da-Quan
    Liu, Gao-Fei
    Yuan, Jue
    Hou, Tai-Ping
    Wang, Jin
    Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of Science and Technology (Natural Science Edition), 2010, 11 (04): : 423 - 427
  • [46] An Efficient Approach for Solving TSP: the Rapidly Convergent Ant Colony Algorithm
    Wang, Lingling
    Zhu, Qingbao
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2008, : 448 - 452
  • [47] Solving Travelling Salesman Problem (TSP) by Hybrid Genetic Algorithm (HGA)
    Al-Ibrahim, Ali Mohammad Hussein
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2020, 11 (06) : 376 - 384
  • [48] Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
    Guo Pan
    Kenli Li
    Aijia Ouyang
    Keqin Li
    Soft Computing, 2016, 20 : 555 - 566
  • [49] Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
    Pan, Guo
    Li, Kenli
    Ouyang, Aijia
    Li, Keqin
    SOFT COMPUTING, 2016, 20 (02) : 555 - 566
  • [50] 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
    MATHEMATICS, 2022, 10 (19)
12345