fast-traffic-simulator 0.1.0__tar.gz

fast_traffic_simulator-0.1.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

fast_traffic_simulator-0.1.0/PKG-INFO

@@ -0,0 +1,126 @@
+Metadata-Version: 2.4
+Name: fast-traffic-simulator
+Version: 0.1.0
+Summary: A NumPy/SciPy-based microscopic traffic simulator
+Project-URL: Homepage, https://github.com/fbk-most/FastTrafficSimulator
+Project-URL: Repository, https://github.com/fbk-most/FastTrafficSimulator
+Author: Marco Pistore
+License: Apache-2.0
+License-File: LICENSE
+Keywords: numpy,scipy,simulation,traffic,transport
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.12
+Requires-Dist: numpy>=1.24
+Requires-Dist: pandas>=2.0
+Requires-Dist: pyarrow>=14.0
+Requires-Dist: scipy>=1.10
+Description-Content-Type: text/markdown
+
+# Fast Traffic Simulator
+
+A NumPy/SciPy-based microscopic traffic simulator for directed road networks.
+
+We develop this package at [@fbk-most](https://github.com/fbk-most), a research unit
+at [Fondazione Bruno Kessler](https://www.fbk.eu/en/).
+
+The simulator models individual vehicles travelling from an origin node to a
+destination node across a directed graph of road edges.  Shortest-path routing
+is computed via Dijkstra's algorithm and can be refreshed periodically to
+reflect current congestion.  Vehicle behaviour on links follows Newell's
+simplified car-following model: each vehicle moves as fast as possible while
+respecting the road speed limit and keeping a safe distance from the vehicle
+ahead.  This reproduces queue formation and congestion without explicit capacity
+constraints.  Nodes are treated as dimensionless transfer points — travel time
+accrues only on links — and each edge supports multiple independent lanes.
+
+*Note: this package is currently in an early development stage. APIs may change
+without notice between releases.*
+
+## Installation
+
+```bash
+pip install fast-traffic-simulator
+```
+
+Or, for development (requires [uv](https://docs.astral.sh/uv/)):
+
+```bash
+git clone https://github.com/fbk-most/FastTrafficSimulator
+cd FastTrafficSimulator
+uv sync
+```
+
+## Quick start
+
+```python
+import pandas as pd
+from fts import Simulator
+
+# Build a minimal two-edge graph: 0 → 1 → 2
+edges = pd.DataFrame({
+    'from':   [0, 1],
+    'to':     [1, 2],
+    'length': [100.0, 150.0],
+    'speed':  [10.0, 15.0],
+    'lanes':  [1, 1],
+})
+
+# One vehicle travelling from node 0 to node 2, departing at step 0
+vehicles = pd.DataFrame({
+    'origin':      [0],
+    'destination': [2],
+    'start':       [0],
+})
+
+simulator, _ = Simulator.build(edges=edges, vehicles=vehicles)
+
+while True:
+    simulator.step()
+    arrived = (simulator.vehicles.status == Simulator.VehicleStatus.ARRIVED.value).sum()
+    if arrived == len(vehicles):
+        break
+
+print(f"Vehicle arrived at step {simulator.vehicles.arrival_time[0]}")
+```
+
+## Main contributors
+
+[Marco Pistore](https://it.linkedin.com/in/marco-pistore): design and implementation.
+
+## Acknowledgements
+
+This software has been developed in the scope of the Bologna Digital Twin project, 
+and partially supported by the following projects:
+
+- NRR ICSC National Research Centre for High Performance Computing, Big Data and Quantum Computing (CN00000013), under
+  the NRRP MUR program funded by the NextGenerationEU.
+- European Structural and Investment Funds, as part of the National Program for Metropolitan Cities and Medium-Sized
+  Cities South 2021-2027, Priority 1 Digital Agenda and Urban Innovation,Action 1.1.2.1 Metropolitan Digital Agenda,
+  Project BO1.1.2.1.a "DIGITAL TWIN: GOVERNANCE AND ENHANCEMENT OF DATA ASSETS"
+
+## License
+
+Copyright 2025-2026 Fondazione Bruno Kessler
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+```
+SPDX-License-Identifier: Apache-2.0
+```

fast_traffic_simulator-0.1.0/README.md

@@ -0,0 +1,101 @@
+# Fast Traffic Simulator
+
+A NumPy/SciPy-based microscopic traffic simulator for directed road networks.
+
+We develop this package at [@fbk-most](https://github.com/fbk-most), a research unit
+at [Fondazione Bruno Kessler](https://www.fbk.eu/en/).
+
+The simulator models individual vehicles travelling from an origin node to a
+destination node across a directed graph of road edges.  Shortest-path routing
+is computed via Dijkstra's algorithm and can be refreshed periodically to
+reflect current congestion.  Vehicle behaviour on links follows Newell's
+simplified car-following model: each vehicle moves as fast as possible while
+respecting the road speed limit and keeping a safe distance from the vehicle
+ahead.  This reproduces queue formation and congestion without explicit capacity
+constraints.  Nodes are treated as dimensionless transfer points — travel time
+accrues only on links — and each edge supports multiple independent lanes.
+
+*Note: this package is currently in an early development stage. APIs may change
+without notice between releases.*
+
+## Installation
+
+```bash
+pip install fast-traffic-simulator
+```
+
+Or, for development (requires [uv](https://docs.astral.sh/uv/)):
+
+```bash
+git clone https://github.com/fbk-most/FastTrafficSimulator
+cd FastTrafficSimulator
+uv sync
+```
+
+## Quick start
+
+```python
+import pandas as pd
+from fts import Simulator
+
+# Build a minimal two-edge graph: 0 → 1 → 2
+edges = pd.DataFrame({
+    'from':   [0, 1],
+    'to':     [1, 2],
+    'length': [100.0, 150.0],
+    'speed':  [10.0, 15.0],
+    'lanes':  [1, 1],
+})
+
+# One vehicle travelling from node 0 to node 2, departing at step 0
+vehicles = pd.DataFrame({
+    'origin':      [0],
+    'destination': [2],
+    'start':       [0],
+})
+
+simulator, _ = Simulator.build(edges=edges, vehicles=vehicles)
+
+while True:
+    simulator.step()
+    arrived = (simulator.vehicles.status == Simulator.VehicleStatus.ARRIVED.value).sum()
+    if arrived == len(vehicles):
+        break
+
+print(f"Vehicle arrived at step {simulator.vehicles.arrival_time[0]}")
+```
+
+## Main contributors
+
+[Marco Pistore](https://it.linkedin.com/in/marco-pistore): design and implementation.
+
+## Acknowledgements
+
+This software has been developed in the scope of the Bologna Digital Twin project, 
+and partially supported by the following projects:
+
+- NRR ICSC National Research Centre for High Performance Computing, Big Data and Quantum Computing (CN00000013), under
+  the NRRP MUR program funded by the NextGenerationEU.
+- European Structural and Investment Funds, as part of the National Program for Metropolitan Cities and Medium-Sized
+  Cities South 2021-2027, Priority 1 Digital Agenda and Urban Innovation,Action 1.1.2.1 Metropolitan Digital Agenda,
+  Project BO1.1.2.1.a "DIGITAL TWIN: GOVERNANCE AND ENHANCEMENT OF DATA ASSETS"
+
+## License
+
+Copyright 2025-2026 Fondazione Bruno Kessler
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+```
+SPDX-License-Identifier: Apache-2.0
+```

fast_traffic_simulator-0.1.0/TODO.md

@@ -0,0 +1,12 @@
+## Ideas and todos
+
+We need to manage:
+
+- multi-edge graphs, either directly or with some tricks (e.g., adding fictitious nodes and edges). At the moment, only
+  one among multiple edges is kept.
+- vehicles starting and ending at the same node
+
+Improvements:
+
+- no need to manage the whole vehicle array in all iterations: we can consider windows of active vehicles (e.g., from
+  first active to last active)

fast_traffic_simulator-0.1.0/examples/demo.py

@@ -0,0 +1,102 @@
+"""Demo script: run the simulator on a small graph and trace vehicle/edge histories.
+
+Usage::
+
+    uv run python examples/demo.py
+
+Input files are located in ``examples/demo_data/``.
+"""
+
+import numpy as np
+import pandas as pd
+from fts import Simulator
+
+
+def run() -> np.ndarray:
+    """Run the demo simulation and return per-step position logs.
+
+    Returns:
+        A float array of shape ``(steps, nr_vehicles, 2)`` where the last axis
+        holds ``[edge_index, edge_distance]`` for each vehicle at each step.
+        Edge index is ``-1`` (distance set to 0) when the vehicle is not in an
+        edge.
+    """
+    edges_file = 'examples/demo_data/demo_graph.csv'
+    vehicles_file = 'examples/demo_data/demo_demand.csv'
+    edges = pd.read_csv(edges_file, names=['id', 'from', 'to', 'length', 'speed', 'lanes'],
+                        skiprows=1, index_col='id')
+    vehicles = pd.read_csv(vehicles_file, names=['origin', 'destination', 'start'],
+                           skiprows=1)
+    vehicles['start'] = vehicles['start'].astype(int)
+    vehicles.index.name = 'id'
+
+    simulator, _ = Simulator.build(edges=edges, vehicles=vehicles)
+    logs = []
+
+    def snapshot() -> np.ndarray:
+        log = np.vstack([simulator.vehicles.edge, simulator.vehicles.edge_distance])
+        log[1, simulator.vehicles.edge == -1] = 0
+        return log.swapaxes(0, 1)
+
+    logs.append(snapshot())
+
+    while True:
+        simulator.step(False)
+        nr_waiting = (simulator.vehicles.status == Simulator.VehicleStatus.WAITING.value).sum()
+        nr_at_node = (simulator.vehicles.status == Simulator.VehicleStatus.AT_NODE.value).sum()
+        nr_in_edge = (simulator.vehicles.status == Simulator.VehicleStatus.IN_EDGE.value).sum()
+        logs.append(snapshot())
+
+        if nr_waiting + nr_at_node + nr_in_edge == 0:
+            break
+
+    return np.array(logs)
+
+
+def vehicle_history(logs: np.ndarray, v: int) -> None:
+    """Print a human-readable movement history for a single vehicle.
+
+    Args:
+        logs: Position log array as returned by :func:`run`.
+        v: Vehicle index.
+    """
+    print(f"History of vehicle {v}")
+    edge = -1
+    for t in range(logs.shape[0]):
+        old_edge = edge
+        edge = int(logs[t, v, 0])
+        dist = logs[t, v, 1]
+        if edge != old_edge:
+            if edge == -1:
+                print(f"- Time {t}: vehicle {v} arrives")
+            else:
+                print(f"- Time {t}: vehicle {v} enters edge {edge}")
+        if edge != -1:
+            print(f"- Time {t}: vehicle {v} is at distance {dist} in edge {edge}")
+
+
+def edge_history(logs: np.ndarray, edge: int) -> None:
+    """Print a human-readable occupancy history for a single edge.
+
+    Args:
+        logs: Position log array as returned by :func:`run`.
+        edge: Edge index.
+    """
+    print(f"History of edge {edge}")
+    vehicles: set[int] = set()
+    for t in range(logs.shape[0]):
+        old_vehicles = vehicles
+        vehicles = {v for v in range(logs.shape[1]) if logs[t, v, 0] == edge}
+        for v in vehicles:
+            dist = logs[t, v, 1]
+            if v not in old_vehicles:
+                print(f"- Time {t}: vehicle {v} enters edge {edge}")
+            print(f"- Time {t}: vehicle {v} is at distance {dist} in edge {edge}")
+        for v in old_vehicles - vehicles:
+            print(f"- Time {t}: vehicle {v} leaves edge {edge}")
+
+
+if __name__ == "__main__":
+    logs = run()
+    vehicle_history(logs, 3)
+    edge_history(logs, 7)

fast_traffic_simulator-0.1.0/examples/demo_data/demo_demand.csv

@@ -0,0 +1,21 @@
+origin,destination,depart_time
+2,6,281.38
+2,6,446.91
+2,6,250.78
+2,6,43.48
+2,6,18.27
+2,6,130.09
+2,6,44.05
+2,6,385.41
+2,6,317.27
+2,6,264.15
+8,5,319.13
+8,5,392.50
+8,5,352.10
+8,5,72.89
+8,5,421.57
+8,5,408.01
+8,5,396.64
+8,5,464.23
+8,5,216.43
+8,5,101.30

fast_traffic_simulator-0.1.0/examples/demo_data/demo_graph.csv

@@ -0,0 +1,25 @@
+id,from,to,length,ffspeed,lanes
+0link_0_1, 0, 1, 298, 30, 1
+0link_0_2, 0, 2, 200, 30, 1
+0link_0_4, 0, 4, 386, 100, 1
+0link_1_0, 1, 0, 298, 30, 1
+0link_1_2, 1, 2, 294, 30, 1
+0link_2_0, 2, 0, 200, 30, 1
+0link_2_1, 2, 1, 294, 30, 1
+0link_2_4, 2, 4, 377, 100, 1
+0link_3_4, 3, 4, 463, 30, 1
+0link_3_5, 3, 5, 287, 30, 1
+0link_3_7, 3, 7, 478, 100, 1
+0link_4_0, 4, 0, 386, 100, 1
+0link_4_2, 4, 2, 377, 100, 1
+0link_4_3, 4, 3, 463, 30, 1
+0link_4_5, 4, 5, 304, 30, 1
+0link_5_3, 5, 3, 287, 30, 1
+0link_5_4, 5, 4, 304, 30, 1
+0link_8_6, 8, 6, 223, 30, 1
+0link_8_7, 8, 7, 335, 30, 1
+0link_6_8, 6, 8, 223, 30, 1
+0link_6_7, 6, 7, 337, 30, 1
+0link_7_3, 7, 3, 478, 100, 1
+0link_7_8, 7, 8, 335, 30, 1
+0link_7_6, 7, 6, 337, 30, 1

fast_traffic_simulator-0.1.0/examples/quickstart.py

@@ -0,0 +1,37 @@
+"""Minimal quickstart example: simulate one vehicle on a synthetic two-edge graph.
+
+No input files are required — the network and demand are built in memory.
+
+Usage::
+
+    uv run python examples/quickstart.py
+"""
+
+import pandas as pd
+from fts import Simulator
+
+# Build a minimal two-edge graph: 0 → 1 → 2
+edges = pd.DataFrame({
+    'from':   [0, 1],
+    'to':     [1, 2],
+    'length': [100.0, 150.0],
+    'speed':  [10.0, 15.0],
+    'lanes':  [1, 1],
+})
+
+# One vehicle travelling from node 0 to node 2, departing at step 0
+vehicles = pd.DataFrame({
+    'origin':      [0],
+    'destination': [2],
+    'start':       [0],
+})
+
+simulator, _ = Simulator.build(edges=edges, vehicles=vehicles)
+
+while True:
+    simulator.step()
+    arrived = (simulator.vehicles.status == Simulator.VehicleStatus.ARRIVED.value).sum()
+    if arrived == len(vehicles):
+        break
+
+print(f"Vehicle arrived at step {simulator.vehicles.arrival_time[0]}")