A SEQUENCE FOR USING ALGORITHMS FOR THE APPROXIMATE SOLUTION IN THE HYBRID ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM

被引：0
|
作者：
SIGAL, IK
机构：
来源：
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 1989年 / 29卷 / 06期
关键词：
D O I：
10.1016/S0041-5553(89)80010-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The construction of the best sequence of a bounded number of approximate algorithms for solving the travelling salesman problem with a given initial tour is considered. A rule for reducing the number of applications of the algorithms in the sequence and a rule for eliminating whole subsequences of algorithms are derived. An algorithm based on these rules is proposed.
引用
收藏
页码：80 / 84
页数：5
相关论文
共 50 条
  • [1] The Quantum Approximate Algorithm for Solving Traveling Salesman Problem
    Ruan, Yue
    Marsh, Samuel
    Xue, Xilin
    Liu, Zhihao
    Wang, Jingbo
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 63 (03): : 1237 - 1247
  • [2] The quantum approximate algorithm for solving traveling Salesman problem
    Ruan, Yue
    Marsh, Samuel
    Xue, Xilin
    Liu, Zhihao
    Wang, Jingbo
    [J]. Ruan, Yue (yue_ruan@ahut.edu.cn); Wang, Jingbo (jingbo.wang@uwa.edu.au), 2020, Tech Science Press (63): : 1237 - 1247
  • [3] Hybrid Algorithm for Solving Traveling Salesman Problem
    Zhao, Ping
    Xu, Degang
    [J]. 2019 3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE APPLICATIONS AND TECHNOLOGIES (AIAAT 2019), 2019, 646
  • [4] A Solution to Traveling Salesman Problem Using Hybrid Genetic Algorithm
    Wang, Jian-cheng
    Yang, Yan-jie
    Lu, Ya-ping
    Lu, Ya-ping
    [J]. 2013 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (ICCSAI 2013), 2013, : 235 - 240
  • [5] THE TRAVELING SALESMAN PROBLEM - APPROXIMATE ALGORITHMS
    MELAMED, II
    SERGEEV, SI
    SIGAL, IK
    [J]. AUTOMATION AND REMOTE CONTROL, 1989, 50 (11) : 1459 - 1479
  • [6] Solving the traveling salesman problem using a hybrid genetic algorithm approach
    Lin, Wei
    Delgado-Frias, Jose G.
    Gause, Donald C.
    [J]. Artificial Neural Networks in Engineering - Proceedings (ANNIE'94), 1994, 4 : 1069 - 1074
  • [7] RAPID HEURISTIC ALGORITHM FOR APPROXIMATE SOLUTION OF TRAVELING SALESMAN PROBLEM
    WIORKOWSKI, JJ
    MCELVAIN, K
    [J]. TRANSPORTATION RESEARCH, 1975, 9 (2-3): : 181 - 185
  • [8] APPROXIMATE SOLUTION OF THE TRAVELING SALESMAN PROBLEM
    Dulkeyt, V., I
    Faizulin, R. T.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2009, 3 (01): : 72 - +
  • [9] Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm
    Kaur, D.
    Murugappan, M. M.
    [J]. 2008 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, VOLS 1 AND 2, 2008, : 1 - 6
  • [10] AN ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    KAREL, C
    SWEENEY, DW
    [J]. OPERATIONS RESEARCH, 1963, 11 : B48 - B48
12345