Let's imagine that you have 50 addresses to which you need to visit, but among them, there are 6 addresses for which urgency is important, and saving time and distance fade into the background. How to plan route to visit first 6 addresses quickly and then others and still have most optimal route with given parameters? 
For this, we introduced the new option where instead of specifying a time window, the ASAP sign is set. In this case, the optimization algorithm will find an option where urgent addresses will be delivered first, and the rest will be calculated so that the route would be optimal according to the specified parameters for each address.

Let's imagine that you have 50 addresses to which you need to visit, but among them, there are 6 addresses for which urgency is important, and saving time and distance fade into the background. How to plan route to visit first 6 addresses quickly and then others and still have most optimal route with given parameters? 

For this, we introduced the new option where instead of specifying a time window, the ASAP sign is set. In this case, the optimization algorithm will find an option where urgent addresses will be delivered first, and the rest will be calculated so that the route would be optimal according to the specified parameters for each address.  

Prioritizes tasks