Suppose you have 50 deliveries and you hire four drivers to make those deliveries. Each driver is either paid for a certain number of hours or is paid for a certain number of jobs. In this case, you wouldn’t necessarily want one driver to get all 50 deliveries, even if this minimizes the total variable […]
Introduction A few years ago, we wrote a tutorial to show you how to model a traveling salesman problem with a week-planning horizon. Since then we have been improving our API a lot and I would like to show you how easy it is now to model this with driver shifts. For example, suppose you […]
We’re happy to announce our new product: the Cluster API! It solves the “capacity clustering problem” by assigning a set of customers to a given number of distinct groups (called clusters). The API “clusters” by minimizing the total distance from each individual customer to its designated group median. It can also consider minimum and maximum […]
The Route Optimization API works via an HTTP endpoint and you POST a JSON document to https://graphhopper.com/api/1/vrp?key=[YOUR_KEY] This requires an API key that you can get here: login and go to API keys and generate an API key by clicking the Add API key button. Copy it and paste it to [YOUR_KEY]. Let us start […]
We are happy to announce our new API docs. We specified our APIs in the OpenAPI specification language and moved the entire content of our old documentation to a single OpenApi 3.0 document. This has many advantages: There is only a single source for the documentation of new features, and for generating client code to […]
This article shows how to solve a time-dependent vehicle routing problem with cargo bikes and small trucks with GraphHopper’s Optimizaton API. Lets assume that you want to solve a vehicle routing problem with a mixed fleet. The fleet consists of cargo bikes and small trucks, and you want to employ the fleet such that products […]
