{
  "abstract": "Time-dependent routing recognizes that the same journey can take a different time depending on when it begins. Under duration minimization, even the departure time of each vehicle becomes a decision. Exact methods for this setting exist in the literature, but researchers and practitioners have lacked a ready-to-use open solver that combines rich piecewise-linear travel times, early feasible solutions and optimality claims. KAYROS fills this gap with two modes on one checker-consistent engine: an Iterated Local Search that streams improving solutions and a Branch-Price-and-Cut method that can issue computational optimality certificates under explicit arithmetic and search assumptions. It installs with one command and has no proprietary dependency. The public MAMUT-routing store currently contains 704 KAYROS certificates under a four-solve publication protocol, which has also led to the retraction and repair of invalid earlier claims. The report presents two complementary benchmark contributions to MAMUT-routing. The first integrates Blauth2024, a benchmark from the literature whose travel times derive from measured Uber speeds, for which KAYROS provides new best-known solutions on all 40 instances. The second proposes Poryos2026, a new benchmark of 1,080 paired static and time-dependent instances built from OpenStreetMap road networks and controlled synthetic traffic. Finally, the report describes the intensive human-AI collaboration behind this work and the verification practices that kept its outputs independently verifiable.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.23116",
  "author_total": 4,
  "authors": [
    {
      "name": "Florian Rascoussier"
    },
    {
      "name": "Romain Billot"
    },
    {
      "name": "Lina Fahed"
    },
    {
      "name": "Christine Solnon"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/fhggnmvefsn78.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.23116",
  "fulltext_url": null,
  "id": "fhggnmvefsn78",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.23116",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.AI"
    ],
    [
      "arxiv",
      "cs.MS"
    ],
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "2209|Vehicle Routing Optimization Methods"
    ]
  ],
  "openalex": "W7171514892",
  "pdf_url": "https://arxiv.org/pdf/2607.23116",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-19",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/fhggnmvefsn78.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:30:57Z",
      "native_id": "2607.23116",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.23116"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "KAYROS: An Anytime and Exact Open-Source Solver for Duration-Minimization Time-Dependent Vehicle Routing. A Technical Report and a Case Study in Human-AI Engineering",
  "title_text": "KAYROS: An Anytime and Exact Open-Source Solver for Duration-Minimization Time-Dependent Vehicle Routing. A Technical Report and a Case Study in Human-AI Engineering",
  "type": "preprint",
  "updated_at": "2026-10-30T12:33:44Z",
  "url": "https://research.draconitic.com/paper/fhggnmvefsn78",
  "venue": "arXiv",
  "versions": []
}