Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles

The Vehicle Routing Problem (VRP) has existed as long as a dis-tributor has needed to deliver items. As such, the VRP has been solved with many different methods, including agent architecture and ant colony modeling. However, these methods have generally been set up for an established organization that has a specific number of vehicles with only a few unique capacities. This project aims to cre-ate a program that will solve the VRP, but in a case where all the vehicles could have different capacities. This is the situation faced by some volunteer groups that do not have established vehicle fleets and rely on people volunteering vehicles when something needs to be distributed