Package Delivery

Package Delivery Algorithm Overview

View the code

This application is an implementation of the traveling salesmen problem. It takes a list of packages and their delivery addresses, and determines an efficient route to deliver all packages within their given constraints.

This application is intended to demonstrate proficiency in implementing Data Structures and Algorithms. It utilizes a custom HashMap to store and track package information, and it uses a graph structure to map the addresses and distances from each other. It implements a “Nearest Neighbor” algorithm to determine an efficient route.