You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Path4GMNS is an open-source, cross-platform, lightweight, and fast Python path engine for networks encoded in [GMNS](https://github.com/zephyr-data-specs/GMNS). Besides finding static shortest paths for simple analyses, its main functionality is to provide an efficient and flexible framework for column-based (path-based) modeling and applications in transportation (e.g., activity-based demand modeling). Path4GMNS supports, in short,
7
6
@@ -17,16 +16,16 @@ Path4GMNS also serves as an API to the C++-based [DTALite](https://github.com/jd
17
16
* Origin-Destination Matrix Estimation (ODME).
18
17
19
18
## Installation
20
-
Path4GMNS has been published on [PyPI](https://pypi.org/project/path4gmns/0.8.1/), and can be installed using
19
+
Path4GMNS has been published on [PyPI](https://pypi.org/project/path4gmns/0.8.2/), and can be installed using
21
20
```
22
21
$ pip install path4gmns
23
22
```
24
-
If you need a specific version of Path4GMNS, say, 0.8.1,
23
+
If you need a specific version of Path4GMNS, say, 0.8.2,
25
24
```
26
-
$ pip install path4gmns==0.8.1
25
+
$ pip install path4gmns==0.8.2
27
26
```
28
27
29
-
v0.8.1 comes with performance improvement. All previous releases shall be deprecated for any purposes.
28
+
v0.8.2 comes with major performance improvement in column generation module. All previous releases shall be **deprecated**.
30
29
31
30
### Dependency
32
31
The Python modules are written in **Python 3.x**, which is the minimum requirement to explore the most of Path4GMNS. Some of its functions require further run-time support, which we will go through along with the corresponding use cases in the following section.
@@ -395,11 +394,11 @@ As **CMAKE_BUILD_TYPE** will be **IGNORED** for IDE (Integrated Development Envi
395
394
# from the root directory of PATH4GMNS
396
395
$ python setup.py sdist bdist_wheel
397
396
$ cd dist
398
-
# or python -m pip instal pypath4gmns-0.8.1-py3-none-any.whl
399
-
$ python -m pip install path4gmns-0.8.1.tar.gz
397
+
# or python -m pip instal pypath4gmns-0.8.2-py3-none-any.whl
398
+
$ python -m pip install path4gmns-0.8.2.tar.gz
400
399
```
401
400
402
-
Here, 0.8.1 is the version number. Replace it with the one specified in setup.py.
401
+
Here, 0.8.2 is the version number. Replace it with the one specified in setup.py.
403
402
404
403
## Implementation Notes
405
404
@@ -432,10 +431,10 @@ DTALite uses arrays rather than STL containers to store columns. These arrays ar
432
431
13. Fix crucial bug in accessibility evaluation (v0.7.5)
433
432
14. Deprecate node_sum as hash index in column generation (v0.8.0)
434
433
15. Optimize class ColumnVec, setup_agents() in class Network, and column generation module (i.e., colgen.py) (v0.8.1)
434
+
16. Deep code optimization in column generation module with significant performance improvement (v0.8.2)
435
435
436
436
Detailed update information can be found in [Releases](https://github.com/jdlph/Path4GMNS/releases).
437
437
438
-
439
438
## Contribute
440
439
441
440
Any contributions are welcomed including advise new applications of Path4GMNS, enhance documentation (this guideline and [docstrings](https://docs.python-guide.org/writing/documentation/#writing-docstrings) in the source code), refactor and/or optimize the source code, report and/or resolve potential issues/bugs, suggest and/or add new functionalities, etc.
@@ -446,7 +445,7 @@ You are encouraged to join our Slack workspace for more discussions and collabor
446
445
447
446
## How to Cite
448
447
449
-
Li, P. and Zhou, X. (2022, April 9). *Path4GMNS*. Retrieved from https://github.com/jdlph/Path4GMNS
448
+
Li, P. and Zhou, X. (2022, April 30). *Path4GMNS*. Retrieved from https://github.com/jdlph/Path4GMNS
450
449
451
450
## References
452
451
Lu, C. C., Mahmassani, H. S., Zhou, X. (2009). Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem. Transportation Research Part B: Methodological, 43, 345-364.
0 commit comments