首页> 外文会议>International Conference on Cloud Computing and Big Data >When Taxi Meets Bus: Night Bus Stop Planning over Large-Scale Traffic Data
【24h】

When Taxi Meets Bus: Night Bus Stop Planning over Large-Scale Traffic Data

机译:当出租车与公交车相遇时:夜间公交车站会根据大规模的交通数据进行规划

获取原文

摘要

With more and more citizens traveling for life or work at night, there is a big gap between the demands and supplies for public transportation service in China. In this paper, we address the problem of night-bus stop planning by investigating the characteristics of taxi GPS trajectories and transactions, rather than leveraging subjective and costly surveys about citizen mobility patterns. There are two stages in our method. In the first stage, we extract the Pick-up and Drop-off Records (PDRs) from the taxi GPS trajectories and transactions for capturing citizens travel patterns at night. In the second stage, we propose DC-DBSCAN, an improved DBSCAN clustering algorithm by considering the Distance Constraint, to detect hot locations as candidate night-bus stops from the PDRs dataset. We take the service range of a bus stop into consideration, and optimize the candidates by considering the cost and convenience factors. Finally, our experiments demonstrate that our method is valid and with better performance than that of K-means.
机译:随着越来越多的公民在夜间旅行或努力工作,在中国的公共交通服务需求与供应之间存在巨大差距。在本文中,我们通过调查出租车GPS轨迹和交易的特征来解决夜班停止规划问题,而不是利用关于公民移动模式的主观和昂贵的调查。我们的方法中有两个阶段。在第一阶段,我们从出租车GPS轨迹和交易中提取拾取和下降记录(PDR),以便在夜间捕获公民旅行模式。在第二阶段,我们提出DC-DBSCAN,通过考虑距离约束来改进的DBSCAN聚类算法,以检测来自PDRS数据集的候选夜总总线的热点。我们考虑了总线停止的服务范围,并考虑成本和便利因素来优化候选人。最后,我们的实验表明,我们的方法有效,性能比K-means的方法更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号