{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreia54ojjp5euay6i4npsyjsx7ktqqqjizf2qyouveqpjdlam2rddri",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mjw3wtk5ke72"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.16149v1",
  "publishedAt": "2026-04-20T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Denys Katkalo",
    "Andrii Rohovyi",
    "Toby Walsh"
  ],
  "textContent": "**Authors:** Denys Katkalo, Andrii Rohovyi, Toby Walsh\n\nState-of-the-art multimodal journey-planning algorithms, such as ULTRA, have recently been adapted to account for delays. In this work, we extend this approach to be more memory-efficient, faster, and accurate. We also adapt this framework to other state-of-the-art algorithms, like CSA and RAPTOR. We demonstrate a speedup of 1.9-4.2x over existing algorithms in the single-criterion search. In the multicriteria setting, we achieve competitive speedup results but greater accurateness. We also found that our method scales much better as the delay increases.",
  "title": "Fast and Memory Efficient Multimodal Journey Planning with Delays"
}