GraphHopper Route Optimization Stefan Schrder What is GraphHopper? - - PowerPoint PPT Presentation

graphhopper route optimization
SMART_READER_LITE
LIVE PREVIEW

GraphHopper Route Optimization Stefan Schrder What is GraphHopper? - - PowerPoint PPT Presentation

GraphHopper Route Optimization Stefan Schrder What is GraphHopper? Fast and Flexible Directions API Lightweight API to solve heavy routing problems Brief history 04/2012 Peter Karich published OS GraphHopper routing based on


slide-1
SLIDE 1

GraphHopper Route Optimization

Stefan Schröder

slide-2
SLIDE 2
  • Fast and Flexible Directions API
  • Lightweight API to solve heavy routing problems

What is GraphHopper?

slide-3
SLIDE 3
  • 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

slide-4
SLIDE 4

Directions API

slide-5
SLIDE 5

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

  • rdering of via points
slide-6
SLIDE 6

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

slide-7
SLIDE 7

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
slide-8
SLIDE 8

Search algorithms

  • Exact methods – Branch & Bound
  • Meta-Heuristics – Tabu Search, Simulated

Annealing, etc.

  • Ruin and Recreate – Large Neighborhood

Search Threshold Acceptance and Simulated Annealing

slide-9
SLIDE 9

Route Optimization Editor

  • Switch to Route Editor and solve problems live
  • TSP
  • TSP-Relation
  • VRP
  • VRP-Relation
  • VRP-Bike
  • VRP-Min-Max
slide-10
SLIDE 10

Problem Berlin

slide-11
SLIDE 11

Sufficient capacity - TSP

slide-12
SLIDE 12

Direct sequence of 37 & 38

slide-13
SLIDE 13

VRP

slide-14
SLIDE 14

VRP with relation

slide-15
SLIDE 15

VRP – min-max compl. time

slide-16
SLIDE 16

VRP – min-max by foot

slide-17
SLIDE 17

Shortest route through Dublin avoiding pubs?

slide-18
SLIDE 18

Dublin – “avoid pubs”

slide-19
SLIDE 19

Dublin – “avoid pubs”

slide-20
SLIDE 20

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.”

slide-21
SLIDE 21

Shortest route through Dublin visiting all pups?

slide-22
SLIDE 22

Dublin – “visit all pubs”

slide-23
SLIDE 23

Publicity?

  • many retweets from all over the world
  • >3000 readers
  • on reddit
  • a day on the front page of hacker news with 84

points

slide-24
SLIDE 24

Dublin – “visit all pubs”

slide-25
SLIDE 25

GraphHopper.com stefan.schroeder@graphhopper.com

slide-26
SLIDE 26