Truck Routing System
This project was to create the best route and delivery of several packages for Western Governors University Parcel Service (WGUPS). 40 packages need to be delivered across the Salt Lake City area utilizing two trucks and three drivers throughout a typical workday. The information for the packages contained certain constraints, delays, or errors that needed to be remedied before shipment.
March 2021 - April 2021
The Western Governors University Parcel Service (WGUPS) needs to determine an efficient route and delivery distribution for their Daily Local Deliveries (DLD) because packages are not currently being consistently delivered by their promised deadline. The Salt Lake City DLD route has three trucks, two drivers, and an average of 40 packages to deliver each day. Each package has specific criteria and delivery requirements.
• Each truck can carry a maximum of 16 packages, and the ID number of each package is unique.
Scalability and Adaptability
Self-Adjusting Data Structures
Self-Adjusting Data Structures and Hash tables are great in the fact that they will always go with the path of the shortest distance. Also, the time complexity of a hash table is consistent no matter how large the data set is, which works well when there are applications that require different data sets that are both large and small. Collisions, however, can be a disadvantage to using hash tables as they can decrease performance.