A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
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.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it