A Python simulation of a package delivery routing system using a self-adjusting greedy nearest-neighbor algorithm. Optimizes delivery routes across multiple trucks while meeting time, deadline, and special delivery constraints.
- Loads package and distance data from CSV files
- Stores packages in a custom Hash Table data structure
- Uses a nearest-neighbor greedy algorithm to optimize routes
- Simulates 2 drivers operating 3 trucks from a central hub
- Tracks delivery times, mileage, and package status in real time
- Python
- Custom Hash Table implementation
- Greedy nearest-neighbor algorithm
- CSV data processing
- Object-oriented design (Truck, Package, HashTable classes)
python main.py