{'fraction_non_alphanumeric': 0.016908212560386472, 'fraction_numerical': 0.008454106280193236, 'mean_word_length': 5.007246376811594, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Single Vehicle Routing Problem with Deliveries and Selective Pickups in a CPU-GPU Heterogeneous Environment

In this work, we propose a new algorithm to solve a variant of the Vehicle Routing Problem that is the Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVRPDSP). Our algorithm produces good quality solutions that are better than the best known solutions in the literature. In order to reduce the time spent to solve large-sized instances, we also propose here a parallel implementation of our algorithm that explores a heterogeneous environment composed of a CPU and a GPU. Therefore, our algorithm harnesses the tremendous computing power of the GPU to improve the performance of the local searches computation. We obtained average speedups from 2.73 to 16.23 times with our parallel approach.