Package to find locally optimal routes in route networks
Project description
An Algorithm to Compute Locally Optimal Paths for Large-Scale Traffic Models
This package provides an implementation of the algorithm REVC to compute locally optimal routes between many origins and destinations, as described by Fischer et al. (2019). If you use this package in research that leads to a scientific publication, we kindly ask you to cite the publication.
The package is licensed under the LGPL-v3. For documentation please refer to the project's documentation page on github. Please report any bugs on the project's bug tracker. You are welcome to adjust the provided files to your needs and to improve the code. It is encouraged that you share any improvements on the github page if possible.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for lopaths-0.9.0a1-cp37-cp37m-win_amd64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 5a3a4033c848554e503563425bdaba4df18640983956db6a6a58a6d53f1e1ec3 |
|
MD5 | a7ae2040b1df029fb5ee90cef64012d1 |
|
BLAKE2b-256 | f6d2af16dab59c014516fe56ccdf256b7a12a8c7937ea05c951e5ba5cc458918 |