To main content

Solving Routing Problems with the GPU


Due to physical limits, hardware development no longer results in higher speed for sequential algorithms, but rather in increased parallelism. Modern commodity PCs include a multi-core CPU and at least one GPU, providing a low cost, easily accessible heterogeneous environment for high performance computing. New solution methods that combine task parallelization and stream processing and self-adapt to the hardware at hand are needed to fully exploit modern computer architectures and profit from future hardware developments. In this talk, we give an introduction to modern PC architectures and the GPU, and survey the literature on GPU-based solution methods in discrete optimization that currently consists of some 100 papers. Many of them describe GPU implementations of well-known metaheuristics and report impressive speedups relative to a sequential version. As for applications and problems studied, 26 papers describe research on routing problems of which 9 focus on the Shortest Path Problem, 15 discuss the Travelling Salesman Problem, and only 2 study the Vehicle Routing Problem. Finally, we describe a GPU-based Travelling Salesman Problem solver and present numerical results for large-scale instances.


Academic lecture


  • Research Council of Norway (RCN) / 227071
  • Research Council of Norway (RCN) / 217108
  • Research Council of Norway (RCN) / 205298




  • SINTEF Digital / Mathematics and Cybernetics
  • University of Oslo

Presented at

Second Annual Conference of the EURO Working Group on Vehicle Routing and Logistics Optimization (VeRoLog2013)




07.07.2013 - 10.07.2013


University of Southampton



View this publication at Cristin