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
- bypass the check on b > 0 if b is None with respect to the setup of
is_activity_node;
- optimize the setup for bin_index;
- separate _output_equity() from evaluate_accessibility();
- change version number to v0.8.6a1;
- fix misleading code snippet on finding shortest path where the keyword
'seq_type' shall have been provided;
- polish README on Synthesize Zones and OD Demand;
- change version info in README.
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,
6
6
@@ -17,13 +17,13 @@ Path4GMNS also serves as an API to the C++-based [DTALite](https://github.com/jd
17
17
* OD Matrix Estimation (ODME).
18
18
19
19
## Installation
20
-
Path4GMNS has been published on [PyPI](https://pypi.org/project/path4gmns/0.8.5/), and can be installed using
20
+
Path4GMNS has been published on [PyPI](https://pypi.org/project/path4gmns/0.8.6a1/), and can be installed using
21
21
```
22
22
$ pip install path4gmns
23
23
```
24
-
If you need a specific version of Path4GMNS, say, 0.8.5,
24
+
If you need a specific version of Path4GMNS, say, 0.8.6a1,
25
25
```
26
-
$ pip install path4gmns==0.8.5
26
+
$ pip install path4gmns==0.8.6a1
27
27
```
28
28
29
29
v0.8.5 now supports _Apple Silicon_, and _synthesizing zones and demand_. Path4GMNS has evolved dramatically since its early releases with bug fixes, performance improvement, new functionalities. Please **discard all old versions** and **update to or install the latest version**.
You can specify the absolute path or the relative path from your cwd in read_network() to use a particular network from the downloaded sample data set.
Retrieving the shortest path between any two (different) nodes under a specific mode is now available under v0.7.2 or higher.
@@ -427,13 +427,13 @@ print(f'processing time of equity evaluation: {time()-st:.2f} s')
427
427
428
428
Zone information is crucial in conducting traffic assignment, evaluating accessibility and equity. When no zone information is provided along node.csv, Path4GMNS can automatically synthesize a total number of $d * d$ grids (rectangles) as zones given the dimension $d$.
429
429
430
-
Activity nodes are randomly sampled for each zone according to a hardcoded sample rate $r$, where $r = max(10, N / 100)$ and $N$ is the total number of nodes in the network. The total demand, as an input argument, will be allocated to each zone proportionally with respect to the number of its activity nodes.
430
+
Activity nodes are randomly sampled for each zone according to a hardcoded sample rate $r$, where $r = max(10, N / 100)$ and $N$ is the total number of nodes in the network. The total demand, as an input argument, will be allocated to each zone proportionally with respect to the number of its activity nodes, as its synthesized production volume and also attraction volume.
Where, $prod_i$ is the production volume of zone $i$, $attr_i$ is the production volume of zone $j$, $demand$ is the total demand, $N^a$ is the total number of activity nodes, $N_i^a$ is the number of activity nodes in zone $i$.
435
435
436
-
In other words, the allocated demand to each zone serves as its synthesized production volume and also attraction volume. Denote the minimum travel time from zone $i$ to zone $j$ under a specific mode as $mintt_{ij}$ and introduce the following definition on the set of connected zones from zone $i$, which is cut off by a predefined time budget $b$.
436
+
Denote the minimum travel time from zone $i$ to zone $j$ under a specific mode as $mintt_{ij}$ and introduce the following definition on the set of connected zones from zone $i$, which is cut off by a predefined time budget $b$.
Here, 0.8.5 is the version number. Replace it with the one specified in setup.py.
513
+
Here, 0.8.6a1 is the version number. Replace it with the one specified in setup.py.
514
514
515
515
## Implementation Notes
516
516
@@ -562,7 +562,7 @@ You are encouraged to join our [Gmail group](https://groups.google.com/g/path4gm
562
562
563
563
## How to Cite
564
564
565
-
Li, P. and Zhou, X. (2022, September 5). *Path4GMNS*. Retrieved from https://github.com/jdlph/Path4GMNS
565
+
Li, P. and Zhou, X. (2022, September 10). *Path4GMNS*. Retrieved from https://github.com/jdlph/Path4GMNS
566
566
567
567
## References
568
568
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