用于共乘的快速绕行计算
Fast Detour Computation for Ride Sharing
摘要：
今天的拼车服务仍然是模仿一个更好的广告牌。他们列出的报价，并允许搜索的来源和目标城市，有时丰富的径向搜索。因此，在大城市之间寻找联系是很容易的。这些地方都在指定的起源和区分点的名单上。但是，当你想从一个小镇到另一个小镇，即使他们旁边的高速公路，你遇到的问题。你找不到那些会或可以很容易地经过这个城镇而很少或根本不绕道的报价。我们解决这个有趣的问题，提出了一个快速算法，计算提供最小的弯路w.r.t.一个请求我们的实验表明，这个问题是有效的解决时间适合Web服务的实现。对于现实的数据库大小，我们实现了约5ms的查找时间和90%的匹配率，而不是今天使用的简单匹配算法的70%。
英文摘要：
Todays ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So finding a connection between big cities is quite easy. These places are on a list of designated origin and distination points. But when you want to go from a small town to another small town, even when they are next to a freeway, you run into problems. You can't find offers that would or could pass by the town easily with little or no detour. We solve this interesting problem by presenting a fast algorithm that computes the offers with the smallest detours w.r.t. a request. Our experiments show that the problem is efficiently solvable in times suitable for a web service implementation. For realistic database size we achieve lookup times of about 5ms and a matching rate of 90% instead of just 70% for the simple matching algorithms used today.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
