An efficient and scalable method for aggregate nearest neighbor queries on time-dependent road networks

作者：

Highlights：

• Traditional ANN query on time-dependent road network is strict in application.

• A novel and flexible interval departure time query is formally defined.

• Fast and scalable single/interval departure time query algorithms are presented.

• Experiments were conducted to confirm the performance on real/synthetic datasets.

摘要

•Traditional ANN query on time-dependent road network is strict in application.•A novel and flexible interval departure time query is formally defined.•Fast and scalable single/interval departure time query algorithms are presented.•Experiments were conducted to confirm the performance on real/synthetic datasets.

论文关键词：Time-dependent road network,Aggregate nearest neighbor,Graph query,Algorithm

论文评审过程：Received 6 March 2021, Revised 12 October 2021, Accepted 13 October 2021, Available online 29 October 2021, Version of Record 17 November 2021.

论文官网地址：https://doi.org/10.1016/j.is.2021.101925