{"paper":{"title":"Adapting Dijkstra for Buffers and Unlimited Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.DS","authors_text":"Andrii Rohovyi, Denys Katkalo, Toby Walsh","submitted_at":"2026-03-12T09:36:50Z","abstract_excerpt":"In recent years, RAPTOR based algorithms have been considered the state-of-the-art for path-finding with unlimited transfers without preprocessing. However, this status largely stems from the evolution of routing research, where Dijkstra-based solutions were superseded by timetable-based algorithms without a systematic comparison. In this work, we revisit classical Dijkstra-based approaches for public transit routing with unlimited transfers and demonstrate that Time-Dependent Dijkstra (TD-Dijkstra) outperforms MR. However, efficient TD-Dijkstra implementations rely on filtering dominated conn"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our experiments on London and Switzerland networks show that we can achieve a greater than two time speed-up over MR while producing optimal results on both networks with and without buffer times.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That scanning entire trip sequences in TAD adds negligible overhead compared with edge-by-edge filtering and that the two test networks are representative of the general case where buffer times matter.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"TAD adapts Dijkstra to scan trip sequences instead of edges, correctly managing buffer times for optimal unlimited-transfer routing with over 2x speedup versus MR on real networks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6f718afb4b60d5afede763061a2b33ec8d452eccdc50b2fef081c26784c8a8ad"},"source":{"id":"2603.11729","kind":"arxiv","version":4},"verdict":{"id":"8cbd3620-011b-4d3d-8678-6a9dd66a41f3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T12:29:38.226645Z","strongest_claim":"Our experiments on London and Switzerland networks show that we can achieve a greater than two time speed-up over MR while producing optimal results on both networks with and without buffer times.","one_line_summary":"TAD adapts Dijkstra to scan trip sequences instead of edges, correctly managing buffer times for optimal unlimited-transfer routing with over 2x speedup versus MR on real networks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That scanning entire trip sequences in TAD adds negligible overhead compared with edge-by-edge filtering and that the two test networks are representative of the general case where buffer times matter.","pith_extraction_headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.11729/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5596cbeb4f6f8754ee180784163b316a983ea268792fa383a6b5c9ce58de0007"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}