• DocumentCode
    3668580
  • Title

    Parallel Strategies for Harmony Search on CUDA to Solve Traveling Salesman Problem

  • Author

    Kang Chian Le;Rosni Abdullah

  • Author_Institution
    Sch. of Comput. Sci., Univ. Sains Malaysia, Minden, Malaysia
  • fYear
    2015
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    This paper presents parallel strategies applied to Harmony Search (HS) on CUDA for solving Traveling Salesman Problem (TSP), which is an NP-hard problem in combinatorial optimization. The implementations are tested with data instances of varying problem size from TSPLIB to measure speedup attained over serial implementation. In our experiment, HSGPU parallel implementation can acquire 32 times speedup as compared with CPU-based implementation.
  • Keywords
    "Cities and towns","Graphics processing units","Instruction sets","Parallel processing","Sociology","Statistics","Algorithm design and analysis"
  • Publisher
    ieee
  • Conference_Titel
    IT Convergence and Security (ICITCS), 2015 5th International Conference on
  • Type

    conf

  • DOI
    10.1109/ICITCS.2015.7293008
  • Filename
    7293008
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3668580