Abstract
The proliferation of location-based social networks allows people to access location-based services as a group. We address Group Optimal Sequenced Route (GOSR) queries that enable a group to plan a trip with a minimum aggregate trip distance. The trip starts from the source locations of the group members, goes via a predefined sequence of different point of interests (POIs) such as a restaurant, shopping center and movie theater, and ends at the destination locations of the group members. The aggregate trip distance can be the total or the maximum trip distance of the group members. We introduce a novel approach to efficiently compute group optimal sequenced routes in road networks. We exploit elliptical properties to refine the POI search space and develop efficient algorithms for GOSR queries. Experiments show that our approach outperforms a naive approach significantly in terms of processing time and I/Os.
Original language | English |
---|---|
Title of host publication | Proceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015 |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 122-127 |
Number of pages | 6 |
ISBN (Electronic) | 9781479999729 |
DOIs | |
Publication status | Published - 11 Sept 2015 |
Externally published | Yes |
Event | International Conference on Mobile Data Management 2015 - Pittsburg, United States of America Duration: 15 Jun 2015 → 18 Jun 2015 Conference number: 16th http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7263115 (IEEE Conference Proceedings) |
Conference
Conference | International Conference on Mobile Data Management 2015 |
---|---|
Abbreviated title | MDM 2015 |
Country/Territory | United States of America |
City | Pittsburg |
Period | 15/06/15 → 18/06/15 |
Internet address |
|
Keywords
- Group Optimal Sequenced Route Queries
- Location Based Services
- Trip Planning