Parallel CHC algorithm for solving dynamic traveling salesman problem using many-core GPU

  • Authors:
  • Patryk Filipiak;Piotr Lipiński

  • Affiliations:
  • Institute of Computer Science, University of Wroclaw, Wroclaw, Poland;Institute of Computer Science, University of Wroclaw, Wroclaw, Poland

  • Venue:
  • AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a massively parallel evolutionary algorithm with local search mechanism dedicated to dynamic optimization. Its application for solving Dynamic Traveling Salesman Problem (DTSP) is discussed. The algorithm is designed for many-core graphics processors with the Compute Unified Device Architecture (CUDA), which is a parallel computing architecture for nVidia graphics processors. Experiments on a number of benchmark DTSP problems confirmed the efficiency of the algorithm and the parallel computing model designed.