首页> 外文期刊>ACM transactions on knowledge discovery from data >Dynamic Graph Mining for Multi-weight Multi-destination Route Planning with Deadlines Constraints
【24h】

Dynamic Graph Mining for Multi-weight Multi-destination Route Planning with Deadlines Constraints

机译:具有截止日期约束的多重多目标路线规划动态图挖掘

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

摘要

Route planning satisfied multiple requests is an emerging branch in the route planning field and has attracted significant attention from the research community in recent years. The prevailing studies focus only on seeking a route by minimizing a single kind of Travel Cost, such as trip time or distance, among others. In reality, most users would like to choose an appropriate route, neither fastest nor shortest route. Usually, a user may have multiple requirements, and an appropriate route would satisfy all requirements requested by the user. In fact, planning an appropriate route could be formulated as a problem of Multi-weight Multi-destination Route Planning with Deadlines Constraints (MWMDRP-DC). In this article, we propose a framework, namely, MWMD-Router, which addresses the MWMDRP-DC problem comprehensively. To consider the travel costs with time-variation, we propose not only four novel dynamic graph miner to extract travel costs that reveal users' requirements but also two new algorithms, namely, Basic MWMD Route Planning and Advanced MWMD Route Planning, to plan a route that satisfies deadline requirements and optimizes another criterion like travel cost with time-variation efficiently. To the best of our knowledge, this is the first work on route planning that considers handling multiple deadlines for multi-destination planning as well as optimizing multiple travel costs with time-variation simultaneously. Experimental results demonstrate that our proposed algorithms deliver excellent performance with respect to efficiency and effectiveness.
机译:路线规划满足多个请求是路线规划领域的新兴分支,近年来引起了研究界的重大关注。目前研究仅关注通过最小化单一的旅行成本,例如旅行时间或距离等地寻求路线。实际上,大多数用户想选择一个适当的路线,既不是最快,最短的路线都不是最快的。通常,用户可以具有多种要求,并且相应的路由将满足用户请求的所有要求。实际上,规划适当的路线可以作为具有截止日期约束(MWMDRP-DC)的多重多目标路线规划的问题。在本文中,我们提出了一个框架,即MWMD-Router,它全面地解决了MWMDRP-DC问题。要考虑旅行费用随着时间的变化,我们不仅提出了四个新的动态图形矿工,提取了揭示用户要求,也是两个新算法,即基本的MWMD路线规划和先进的MWMD路线规划,以规划路线满足截止日期要求,并有效地优化了旅行成本的另一个标准。据我们所知,这是第一个关于路线规划的工作,考虑处理多目的地规划的多个截止日期以及优化多次旅行成本,同时可以使用时间变化。实验结果表明,我们所提出的算法在效率和有效性方面提供出色的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号