Skip to main content

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. (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.

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

lopaths-0.9.0a7.tar.gz (206.2 kB view hashes)

Uploaded source

Built Distributions

lopaths-0.9.0a7-cp311-cp311-win_amd64.whl (126.5 kB view hashes)

Uploaded cp311

lopaths-0.9.0a7-cp310-cp310-win_amd64.whl (131.4 kB view hashes)

Uploaded cp310

lopaths-0.9.0a7-cp38-cp38-win_amd64.whl (139.6 kB view hashes)

Uploaded cp38

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page