CUDA-Based Genetic Algorithm on Traveling Salesman Problem

被引：0
|
作者：
Chen, Su [1 ]
Davis, Spencer [1 ]
Jiang, Hai [1 ]
Novobilski, Andy [1 ]
机构：
[1] Arkansas State Univ, Dept Comp Sci, Jonesboro, AR 72467 USA
来源：
COMPUTER AND INFORMATION SCIENCE 2011 | 2011年 / 364卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Genetic algorithm is a widely used tool for generating searching solutions in NP-hard problems. The genetic algorithm on a particular problem should be specifically designed for parallelization and its performance gain might vary according to the parallelism hidden within the algorithm. NVIDIA CPUs that support the CUDA programming paradigm provide many processing units and a shared address space to ease the parallelization process. A heuristic genetic algorithm on the traveling salesman problem is specially designed to run on CPU. Then a corresponding CUDA program is developed for performance comparison. The experimental results indicate that a sequential genetic algorithm with intensive interactions can be accelerated by being translated into CUDA code for CPU execution.
引用
下载
收藏
页码：241 / 252
页数：12
相关论文
共 50 条
  • [31] A new genetic algorithm for the asymmetric traveling salesman problem
    Nagata, Yuichi
    Soler, David
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (10) : 8947 - 8953
  • [32] Research on traveling salesman problem based on the ant colony optimization algorithm and genetic algorithm
    Chen, Yu
    Jia, Yanmin
    Open Automation and Control Systems Journal, 2015, 7 (01): : 1329 - 1334
  • [33] A Puzzle-Based Artificial Chromosome Genetic Algorithm for the Traveling Salesman Problem
    Zhang Zhen-Zhen
    Huang Wei-Hsiu
    Lin Jyun-Jie
    Chang Pei-Chann
    Wu Jheng-Long
    2011 INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2011), 2011, : 299 - 304
  • [34] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    SWEENEY, DW
    KAREL, C
    OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989
  • [35] A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem
    Pop, Petrica
    Oliviu, Matei
    Sabo, Cosmin
    HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2017, 2017, 10334 : 149 - 160
  • [36] Pheromone-based crossover operator of genetic algorithm for the traveling salesman problem
    School of Mechanical Engineering, University of Science and Technology Beijing, Beijing 100083, China
    不详
    Beijing Keji Daxue Xuebao, 2008, 10 (1184-1187): : 1184 - 1187
  • [37] Solving Asymmetric Traveling Salesman Problem using Genetic Algorithm
    Birtane Akar, Sibel
    Sahingoz, Ozgur Koray
    2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 1655 - 1659
  • [38] The Massively Parallel Mixing Genetic Algorithm for the Traveling Salesman Problem
    Varadarajan, Swetha
    Whitley, Darrell
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 872 - 879
  • [39] A feature model of genetic algorithm for generalized traveling salesman problem
    Wu, Guangchao
    Huang, Han
    Journal of Information and Computational Science, 2009, 6 (01): : 155 - 161
  • [40] Genetic algorithm with neighbor solution approach for Traveling Salesman Problem
    Abu Zitar, Raed
    Essam
    Shehabat, Essa
    NEURAL NETWORK WORLD, 2007, 17 (05) : 497 - 504
12345