OVR Problem – Intelligent Water Drops
For this project I had to review the Open Vehicle Routing problem, implement an intelligent water drops (IWD) algorithm to solve it, and report computational results on tests from a high diversity of situations.
The OVRP consists of defining the routes for a fleet of vehicles that must service a set of customers with a given demand and known geographical location. Each route is a sequence of customers that starts at the depot and finishes at one of the customers.
The IWD-OVRP was coded in C, compiled using Dev-C++, and run on an Asus Laptop Intel® Core™ i7-4510U CPU @ 2.00 GHz with 8 GB of RAM using Windows 10. In the following Tables 1, 2 and 3, the results are presented including total distance covered (TDC), number of vehicles used (NVU) and execution time (ET).
