An Exact Parallel Algorithm for Traveling Salesman Problem

被引：0
|
作者：
Burkhovetskiy, V. [1 ]
Steinberg, B. [1 ]
机构：
[1] Southern Fed Univ, Inst Math Mech & Comp Sci, Milchakova St 8, Rostov Na Donu 344090, Russia
来源：
CEE-SECR'17: PROCEEDINGS OF THE 13TH CENTRAL & EASTERN EUROPEAN SOFTWARE ENGINEERING CONFERENCE IN RUSSIA | 2017年
关键词：
parallel computing; tree traversal; branch-and-bound; traveling salesman problem;
D O I：
10.1145/3166094.3166108
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We describe an exact algorithm for traveling salesman problem based on simplified branch-and-bound algorithm developed by E. Balas and N. Christofides, parallelized with OpenMP on a multi-core processor. It has shown better performance than algorithms in preceding articles and works. Our article is intended for people who use parallel programming technologies, deal with mathematical optimization problems, have interest in perspective algorithms for bioinformatics or NP-hard problems.
引用
收藏
页数：5
相关论文
共 50 条
  • [41] THE TRAVELING SALESMAN PROBLEM .2. EXACT METHODS
    MELAMED, II
    SERGEEV, SI
    SIGAL, IK
    AUTOMATION AND REMOTE CONTROL, 1989, 50 (10) : 1303 - 1324
  • [42] Exact algorithms for the traveling salesman problem with draft limits
    Battarra, Maria
    Pessoa, Artur Alves
    Subramanian, Anand
    Uchoa, Eduardo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (01) : 115 - 128
  • [43] Exact time-efficient combined algorithm for solving the asymmetric traveling salesman problem
    Zhukova, Galina N.
    Ulyanov, Mikhail V.
    Fomichev, Mikhail I.
    BIZNES INFORMATIKA-BUSINESS INFORMATICS, 2018, 45 (03): : 20 - 28
  • [44] Exact models for the flying sidekick traveling salesman problem
    Dell'Amico, Mauro
    Montemanni, Roberto
    Novellani, Stefano
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (03) : 1360 - 1393
  • [45] THE TRAVELING SALESMAN PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS
    LAPORTE, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 59 (02) : 231 - 247
  • [46] Discrete komodo algorithm for traveling salesman problem
    Jati, Gilang Kusuma
    Kuwanto, Garry
    Hashmi, Tahir
    Widjaja, Herman
    APPLIED SOFT COMPUTING, 2023, 139
  • [47] An Improved Hybrid Algorithm for Traveling Salesman Problem
    Bai, Qiuying
    Li, Guizhi
    Sun, Qiheng
    2015 8TH INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS (BMEI), 2015, : 806 - 809
  • [48] An approximation algorithm for the traveling salesman problem with backhauls
    Gendreau, M
    Laporte, G
    Hertz, A
    OPERATIONS RESEARCH, 1997, 45 (04) : 639 - 641
  • [49] A polynomial algorithm for a constrained traveling salesman problem
    Rubinstein, JH
    Thomas, DA
    Wormald, NC
    NETWORKS, 2001, 38 (02) : 68 - 75
  • [50] A fast evolutionary algorithm for traveling salesman problem
    Yan, Xue-Song
    Liu, Han-Min
    Yan, Jia
    Wu, Qing-Hua
    ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2007, : 85 - +
12345