【24h】

The Single Vehicle Routing Problem with Deliveries and Selective Pickups in a CPU-GPU Heterogeneous Environment

机译:在CPU-GPU异构环境中具有交付和选择性接送的单车路线问题

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:在这项工作中,我们提出了一种新的算法来解决车辆路径问题的一种变体,即带有交货和选择性接送的单车辆路径问题(SVRPDSP)。我们的算法产生的高质量解决方案优于文献中最著名的解决方案。为了减少解决大型实例所花费的时间,我们在此处还提出了算法的并行实现,该算法探索了由CPU和GPU组成的异构环境。因此,我们的算法利用了GPU的巨大计算能力来提高本地搜索计算的性能。通过我们的并行方法,我们获得了2.73到16.23倍的平均加速比。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号