NDLI: A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries

Content Provider	IEEE Xplore Digital Library
Author	Ahmadi, E. Nascimento, M.A.
Copyright Year	2015
Description	Author affiliation: Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada (Ahmadi, E.; Nascimento, M.A.)
Abstract	We study Sequenced Group Trip Planning Queries (SGTPQs). Consider a road network where some vertices represent Points of interest (POIs) and each POI belongs to exactly one Category of Interest (COI), e.g., A COI can be "Restaurants" and each POI in this COI is a specific instance of a restaurant. Given a group of users, each starting from a (possibly distinct) source location and going ultimately to a (possibly distinct) destination, as well as a ordered sequence of COIs, the SGTPQ finds, for each user, the route from his/her source location to his/her destination such that all users go through the same POIs, each one belonging to the specified sequence of COIs, while minimizing the total distance travelled by all users in the group. Different from previous work which investigated SGTPQs in Euclidean distance, we focus on SGTPQs in the more realistic case of road networks. The only existing algorithm for processing SGTPQs which may be also applicable in road networks, named IA, suffers from two drawbacks: it is not able to produce optimal answers and is computationally expensive. The first contribution of this paper is a small modification to IA, so that it can provide optimal solutions. The second and main contribution is a new approach, called Progressive Group Neighbour Exploration (PGNE) that delivers the optimal solution while being more efficient than IA. Our extensive experiments based on real and synthetic datasets show that PGNE is always faster than the modified IA and, in particular, typically twice as fast with respect to the number of users in the group travelling together, an important parameter for this type of query.
Starting Page	24
Ending Page	33
File Size	481457
Page Count	10
File Format	PDF
e-ISBN	9781479999729
DOI	10.1109/MDM.2015.49
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-15
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Position measurement Iterative methods Planning Roads Tin Search problems Euclidean distance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Computation of Group Optimal Sequenced Routes in Road Networks

Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems

Enhanced Iterative-Deepening Search (1994)

Enhanced iterative-deepening search (1994).

Search Strategies for Functional Logic Programming (2012)

Search strategies for functional logic programming.

Combining breadth-first with depth-first search algorithms for VLSI wire routing

Breadth-depth search is p-complete (1994).

Combining breadth-first and depth-first strategies in for treewidth (2008)

A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries

Similar Documents

Efficient Computation of Group Optimal Sequenced Routes in Road Networks

Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems

Enhanced Iterative-Deepening Search (1994)

Enhanced iterative-deepening search (1994).

Search Strategies for Functional Logic Programming (2012)

Search strategies for functional logic programming.

Combining breadth-first with depth-first search algorithms for VLSI wire routing

Breadth-depth search is p-complete (1994).

Combining breadth-first and depth-first strategies in for treewidth (2008)

A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries