Vehicle Routing Problem. How to solve it in Java?
Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks, a central problem in the areas of transportation, distribution and logistics. Decreasing transport costs can be achieved through better resources (vehicles) utilization.
VRP is to design route for N vehicles with M depots and P customers in order to meet the given constraints (less time, less fuel, less trucks, less workers). Looks pretty complicated, doesn’t it?
We will talk about VRP theory, real use cases, Java frameworks, which help to solve it, and best practices. This speech will show us how limited Google Maps Directions API is and how OptaPlanner and other VRP-solvers can fill this gap out. We will go through sample application and analyze how efficient it is.
- Senior Java Developer at SoftServe
- 5+ years of experience in Java development
- Software engineer mainly focused on distributed systems development and VRP solutions