WGUPS Delivery System
An optimized delivery route planner for the WGUPS package system, built using greedy and nearest neighbor algorithms.
Overview
This project simulates the Western Governors University Parcel Service (WGUPS) package delivery system, solving the Traveling Salesman Problem (TSP) using greedy heuristics and the nearest neighbor algorithm to optimize delivery routes.
It was created as part of the Data Structures and Algorithms course and required designing efficient systems using custom hash maps and time-aware logic.
Purpose
The purpose of the WGUPS Delivery System is to minimize delivery times while meeting strict package constraints. These include deadlines, driver limits, and delayed start times—mirroring real-world logistical problems.
This project demonstrates both my algorithmic thinking and my ability to manage complex systems with dynamic input conditions.
Technologies
- Python
- CSV parsing
- Custom hash tables
- Graph and greedy algorithms
Features
- Dynamic address lookup via custom hash table
- Optimized route planning for multiple trucks
- Console-based status reporting with time simulation