How panhaath/sit215 works
This is a notebook-based campus truck-delivery planning submission. Its principal workflow models campus routes and constraints, formulates delivery states, searches for feasible routes, and compares algorithm and heuristic performance. The README documents these relationships, but no notebook source was available to verify finer-grained call wiring; all implementation nodes therefore point to the notebook.
Main entry points: s224529554.ipynb Delivery problem · algorithm_results.csv Algorithm results · heuristic_results.csv Heuristic results
Components 12
Environment Model
- Campus environment
s224529554.ipynb - Path feasibility
s224529554.ipynb
Route Planning
- Delivery problem
s224529554.ipynb - A* search
s224529554.ipynb - UCS search
s224529554.ipynb - Baseline heuristic
s224529554.ipynb - Enhanced heuristic
s224529554.ipynb
Evaluation
- Algorithm comparison
s224529554.ipynb - Heuristic comparison
s224529554.ipynb - Algorithm results
algorithm_results.csv - Heuristic results
heuristic_results.csv
Other components
- Notebook user
Connections 13
- Notebook user → Campus environment: runs notebook
- Delivery problem → Campus environment: uses model
- Delivery problem → Path feasibility: checks paths
- Delivery problem → A* search: searches with
- Delivery problem → UCS search: searches with
- A* search → Baseline heuristic: uses heuristic
- A* search → Enhanced heuristic: evaluates heuristic
- Algorithm comparison → A* search: compares
- Algorithm comparison → UCS search: compares
- Algorithm comparison → Algorithm results: writes results
- Heuristic comparison → Baseline heuristic: compares
- Heuristic comparison → Enhanced heuristic: compares
- Heuristic comparison → Heuristic results: writes results