Package to find locally optimal routes in route networks
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. (2020). 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.
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size lopaths-0.9.0a6-cp38-cp38-win_amd64.whl (286.9 kB)||File type Wheel||Python version cp38||Upload date||Hashes View|
|Filename, size lopaths-0.9.0a6.tar.gz (206.0 kB)||File type Source||Python version None||Upload date||Hashes View|
Hashes for lopaths-0.9.0a6-cp38-cp38-win_amd64.whl