●Fast and Flexible Directions API
●Lightweight API to solve heavy routing problems
What is GraphHopper?
●04/2012 – Peter Karich published OS GraphHopper routing
based on OSM
●06/2013 – Stefan Schröder published jsprit, a toolkit to solve
vehicle routing problems
●04/2015 – we joined forces to develop the GraphHopper
Directions API
Brief history
Directions API
Route Optimization API
●Difference between Routing and Route
Optimization API
Least cost path
from A to B
Least cost paths with
via points
A
B
A
B
C
D
E
A
B
C
D
E
Least cost route by
ordering of via points
Route Optimization API
1. Geocode
2. Snap Geocodes to
networks
3. Calculate n x n travel
times/distances
4. Optimize
Friedrichstraße 52
lon,lat
1
n
1 n
Vehicle Routing Problem
●VRP: Given m vehicles with capacity restrictions and n
customers, find vehicle routes that minimize
transportation costs.
●TSP: Round trip visiting every location once
●Last mile deliveries, health care, garbage collection,
technicians, ...
●Challenges: Search space, Example 50 L-TSP
Search algorithms
●Exact methods – Branch & Bound
●Meta-Heuristics – Tabu Search, Simulated
Annealing, etc.
●Ruin and Recreate – Large Neighborhood
Search Threshold Acceptance and Simulated
Annealing
Route Optimization Editor
●Switch to Route Editor and solve problems live
●TSP
●TSP-Relation
●VRP
●VRP-Relation
●VRP-Bike
●VRP-Min-Max
Problem Berlin
Sufficient capacity - TSP
Direct sequence of 37 & 38
VRP
VRP with relation
VRP – min-max compl. time
VRP – min-max by foot
Shortest route through
Dublin avoiding pubs?
Dublin – “avoid pubs”
Dublin – “avoid pubs”
Publicity?
●handful retweets
●<100 blog readers
●pointer to this: “there's someone trying to drink in
every pub in Dublin, might be another interesting
demo for you.”
Shortest route through
Dublin visiting all pups?
Dublin – “visit all pubs”
Publicity?
●many retweets from all over the world
●>3000 readers
●on reddit
●a day on the front page of hacker news with 84
points