Alternatives and similar repositories for catchup:

Users that are interested in catchup are comparing it to the libraries listed below

• GVeitBatz / KaTCH
  KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies
  ☆77Updated 3 years ago
• kit-algo / InertialFlowCutter
  C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.
  ☆12Updated 2 years ago
• kit-algo / ULTRA
  UnLimited TRAnsfers for Efficient Multimodal Journey Planning
  ☆71Updated 8 months ago
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated this week
• vbuchhold / routing-framework
  This repository contains C++ source code used in several publications in the area of route planning.
  ☆38Updated 3 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• cetusteam / contraction-hierarchies
  ☆22Updated 5 years ago
• kit-algo / rust_road_router
  ☆35Updated 2 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• smart-fm / simmobility-prod
  SimMobility production repository
  ☆67Updated 2 years ago
• jdlph / Path4GMNS
  An open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in GMNS.
  ☆60Updated last month
• olga-perederieieva / TAsK
  Traffic Assignment frameworK (TAsK). Traffic assignment algorithms for the conventional and non-additive traffic assignment problems.
  ☆45Updated 7 years ago
• FOR2083 / PublicTransportNetworks
  The grid dataset, provided by DFG research unit FOR2083
  ☆13Updated last year
• xzhou99 / space-time-network_optimization_4_transportation_logistics
  ☆40Updated 2 years ago
• RoutingKit / RoutingKit
  RoutingKit is a C++ library that provides advanced route planning functionality.
  ☆384Updated 8 months ago
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆15Updated 2 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• 10heey1 / TDSPP
  Time-dependent shortest path problem
  ☆12Updated 4 years ago
• xzhou99 / Dtalite_NeXTA_package
  DTALite-NEXTA Software Release
  ☆68Updated 4 years ago
• michaelwegner / CRP
  C++ Implementation of Customizable Route Planning (CRP) by Delling et al.
  ☆116Updated 9 years ago
• SebMilardo / TDSP
  Finding the Time-Dependent Shortest Path over Large Graphs in Python
  ☆18Updated 6 years ago
• kit-ifv / mobitopp
  ☆20Updated 11 months ago
• p-ortmann / dyntapy
  ☆11Updated last year
• jiawlu / OSM2GMNS
  ☆100Updated last week
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months ago
• tchond / kspwlo
  Exact and approximate algorithms for processing k-SPwLO queries.
  ☆19Updated 2 years ago
• RenatoArbex / TransitNetworkDesign
  Transit Network Design Instances for Research
  ☆28Updated 6 years ago
• AequilibraE / aequilibrae
  aequilibrae - Python package for transportation modeling
  ☆180Updated this week
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆90Updated 10 years ago
• dukduque / jPulseBase
  Java codification of the pulse algorithm to solve the Constrained Shortest Path Problem (CSP)
  ☆21Updated 7 years ago