Vehicle Routing Problem: how to solve it in Java?

A session at JEEConf 2016

Saturday 21st May, 2016

12:55pm to 1:40pm (KMT)

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.

About the speaker

This person is speaking at this event.
Stanislav Kyfenko

Senior Java Developer at SoftServe bio from LinkedIn

Sign in to add slides, notes or videos to this session

JEEConf 2016

Ukraine Ukraine, Kiev

20th21st May 2016

Tell your friends!


Time 12:55pm1:40pm KMT

Date Sat 21st May 2016

Short URL


Official event site


View the schedule


See something wrong?

Report an issue with this session