This is a repository for the Data Structure group assignment during my 1st year 2nd Semester.
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?". It generalises the well-known travelling salesman problem (TSP). Reference: Wikipedia
This set of code solves the VRP using 4 different algorithms which are the Breadth-First Search, Depth-First Search, Greedy Search, and the Monte Carlo Tree Search.