The HERE Tour Planning API allows you to dynamically optimize routes for multiple vehicles visiting a set of locations given real-life constraints, such as limited capacity in a vehicle or delivery time windows, providing such benefits as:

  • Improving your fleet utilization by finding a cost-effective stop sequence to service your locations.
  • Solving the complicated vehicle routing problem between multiple locations for a full fleet of vehicles.
  • Considering multiple constraints that can be defined when you are specifying the problem.

The HERE Touring Planning API returns a cost-effective sequence to visit all the stops in your daily plan.

The HERE Tour Planning API supports the following use cases:

  • Capacitated vehicle routing problem: You can use Tour Planning API to take your vehicle capacity into account when routing your vehicles.
  • Vehicle routing problem with time windows: With Tour Planning API, you can schedule your vehicles to visit depots only when they are available.
  • Multi-depot vehicle routing problem: In a simple vehicle routing problem, all vehicles start from the same location. In the multi-depot vehicle routing problem, vehicles start from multiple depots and return to their depots of origin at the end of their assigned tours.
  • Open vehicle routing problem: Do you work with drivers who do not return their vehicles to a planned location? With Tour Planning API, you can schedule open vehicle routing where your drivers can return to their homes after work.
  • Heterogeneous or mixed fleet VRP: Tour Planning API supports routing multiple types of vehicles with different gas mileage, cost of driving, capacity, and more. For example, your fleet can include passenger vehicles and even specialized trucks with fridges in one route.
  • Pick up and delivery vehicle routing problem: With Tour Planning API, you can schedule a vehicle to pick up and deliver an item in one route.
  • Vehicle routing problem with priorities: Do you have some jobs that must be served today, and the others that could be delayed? And ideally you would like to prevent those priority jobs from being skipped in cases where fleet capacity or shift durations do not allow to serve all the jobs? But at the same time you would like to serve as many non-priority jobs as possible? With the Tour Planning API, you can define such jobs to be in higher priority. So the algorithm will try to avoid skipping them and will skip the low priority jobs instead, when it is impossible to serve all the jobs. The priority of a job does not imply its order in the route. The position of a high priority job might be anywhere in the route and not necessarily before lower priority jobs.
  • Vehicle routing problem with territories: With Tour Planning API, you can assign jobs to territories. Vehicles can be assigned one or more territories serving jobs in those territories preferentially and/or exclusively.
  • Vehicle routing problem with multiple shifts: You can define multiple shifts per vehicle and specify preferences for certain jobs to be served in a specific shift.


The HERE Tour Planning API is not a part of HERE's Freemium Plan. Please contact us to request either an evaluation or a usage license.

For information on:

results matching ""

    No results matching ""