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).

Privacy Settings
We use cookies to enhance your experience while using our website. If you are using our Services via a browser you can restrict, block or remove cookies through your web browser settings. We also use content and scripts from third parties that may use tracking technologies. You can selectively provide your consent below to allow such third party embeds. For complete information about the cookies we use, data we collect and how we process them, please check our Privacy Policy
Consent to display content from - Youtube
Consent to display content from - Vimeo
Google Maps
Consent to display content from - Google