Efficient trip scheduling algorithms for groups

作者：

Highlights：

• Introduce group trip scheduling (GTS) queries to schedule activities with the minimum group cost.

• Develop both exact and approximate approaches for efficient processing of GTS queries.

• Propose a GTS query variant, a uniform GTS query and provide an efficient solution for the variant.

• Extend our approaches for handling constraints like dependencies among POIs and group members.

摘要

•Introduce group trip scheduling (GTS) queries to schedule activities with the minimum group cost.•Develop both exact and approximate approaches for efficient processing of GTS queries.•Propose a GTS query variant, a uniform GTS query and provide an efficient solution for the variant.•Extend our approaches for handling constraints like dependencies among POIs and group members.

论文关键词：Group trip scheduling,Spatial databases,Road networks

论文评审过程：Received 4 July 2018, Revised 20 February 2019, Accepted 5 April 2019, Available online 20 May 2019, Version of Record 20 May 2019.

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