kit-algo / catchup
Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"
☆10Updated 4 years ago
Alternatives and similar repositories for catchup:
Users that are interested in catchup are comparing it to the libraries listed below
- C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.☆12Updated 2 years ago
- UnLimited TRAnsfers for Efficient Multimodal Journey Planning☆70Updated 7 months ago
- KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies☆77Updated 3 years ago
- This repository contains C++ source code used in several publications in the area of route planning.☆38Updated 3 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- ☆35Updated last year
- ☆22Updated 5 years ago
- The grid dataset, provided by DFG research unit FOR2083☆13Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- An open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in GMNS.☆61Updated last month
- Time-dependent shortest path problem☆12Updated 4 years ago
- State-of-the-art open-source applications for Transportation Optimization, Modeling, and Simulation☆11Updated 6 months ago
- Implementation of the graph partitioning algorithm described in paper "Graph Partitioning with Natural Cuts" in the 2011 IEEE Internation…☆26Updated 8 years ago
- C++ Implementation of Customizable Route Planning (CRP) by Delling et al.☆114Updated 8 years ago
- Traffic Assignment frameworK (TAsK). Traffic assignment algorithms for the conventional and non-additive traffic assignment problems.☆45Updated 7 years ago
- RoutingKit is a C++ library that provides advanced route planning functionality.☆384Updated 7 months ago
- ☆95Updated this week
- SimMobility production repository☆67Updated 2 years ago
- This program solves the user equilibrium and stochastic user equilibrium for the city network☆126Updated 3 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆15Updated 2 years ago
- ☆19Updated 3 years ago
- Tools for working with matsim in python☆60Updated 3 weeks ago
- Finding the Time-Dependent Shortest Path over Large Graphs in Python☆18Updated 6 years ago
- aequilibrae - Python package for transportation modeling☆177Updated 2 weeks ago
- towards a working Frank-Wolfe implementation of the equilibrium assignment in Python☆51Updated 8 years ago
- A repository containing code examples around MATSim☆90Updated this week
- Exact and approximate algorithms for processing k-SPwLO queries.☆19Updated last year
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- Open source experiences and profiles.☆134Updated last year
- General Modeling Network Specification☆119Updated 2 weeks ago