SLIDE 1
Corporate Strategy
Pieter de Waard
SEXY STANDARDS?
IPIC 2019, JULY 9TH
Hypes
20 augustus 2019
|
2
“Smart” Algorithms
SEXY STANDARDS? IPIC 2019, JULY 9TH Pieter de Waard Corporate - - PowerPoint PPT Presentation
SEXY STANDARDS? IPIC 2019, JULY 9TH Pieter de Waard Corporate - - PowerPoint PPT Presentation
SEXY STANDARDS? IPIC 2019, JULY 9TH Pieter de Waard Corporate Strategy Hypes Smart Algorithms | 2 20 augustus 2019 Smart Algorithms ? An algorithm (from the Persian word Gaarazmi : named after the Persian
SLIDE 2
SLIDE 3
“ Smart Algorithms ?”
“An algorithm (from the Persian word Gaarazmi : يمزراوخ named after the Persian mathematician Al- Chwarizmiيمزراوخلا ىسوم نب دمحم) is a finite set of instructions, typically to solve a class of problems or perform a computation”
Wikipedia 2019
20 augustus 2019
|
3
SLIDE 4
Dijkstra’s Algorithm
- Edsger Wybe Dijkstra
- From Rotterdam
- Dijkstra Algorithm / Shortest Path Algorithm
- “Invented” in1956 and published in 1959
- 20 Minutes
20 augustus 2019
|
4
“The question of whether Machines Can Think... is about as relevant as the question of whether Submarines Can Swim” "Computer Science is no more about computers than astronomy is about telescopes."
SLIDE 5
Dijkstra’s Algorithm
Google Maps (initially) TomTom (initially) Booking Tickets (lowest costs) Optimization Problems (Mostly minimization)
20 augustus 2019
|
5
SLIDE 6
Dijkstra’s Algorithm
20 augustus 2019
|
6
B F A C D E G
5 4 3 7 8 11 6 3 5 10 3 2
∞ ∞ ∞ ∞ ∞ ∞ visited nodes: (A) A
1. Start Node – Goal Node 2. Nodes (“vertices”) 3. Paths (“edges”) 4. “Distances” 5. Infinity on nodes, except for the starting node. 6. Visited nodes list
SLIDE 7
Dijkstra’s Algorithm
August 20, 2019
|
7
B F A C D E
5 4 3 7 8 11 6 3 5 10 3 2 4
∞
3
∞ ∞
7
1. Start Node – Goal Node 2. Nodes (“vertices”) 3. Paths (“edges”) 4. “Distances” 5. Infinity on nodes, except for the starting node. 6. Visited nodes list
visited nodes: (A) A C
14
visited nodes: (A, C) B visited nodes: (A, B, C)
9
E visited nodes: (A, B, C, E)
12
G D visited nodes: (A, B, C, D, E)
11
F visited nodes: (A, B, C, D, E, F)
SLIDE 8
Potential Problems “Broken” Network
No Data Incomplete Data Unclear Definitions F or f 2x f
Dijkstra’s Algorithm
20 augustus 2019
|
8
B F A C D E G
5 4 3 7 8 11 6 3 5 10 3 2
∞ ∞ ∞ ∞ ∞ ∞ / / f f
ERROR!
SLIDE 9
Real World
20 augustus 2019
|
9
Container Routed via Rotterdam
Data & Standards (on edges & vertices)
- Where do I sail to? (Which terminal, which berth, which berth position)
- What are the possible paths (routes) in the port? (which routing measures are in place; cargo type, weather type,
draught?)
- Which Rotterdam??
If not clearly defined, there is no single algorithm solving any routing optimization problem!
SLIDE 10
Smart Algorithms
Data Standards Goal
20 augustus 2019
|
10
Algorithm (or Physical internet)
https://portcalloptimization.org/
SLIDE 11
Smart Algorithms
11
“Aim for brevity while avoiding jargon”
September 5, 1996
SLIDE 12
20 augustus 2019
|
12
Pieter de Waard Port of Rotterdam Corporate Strategy pieter.dewaard@portofrotterdam.com Ben van Scherpenzeel Taskforce Port Call Optimization scherpenzeel@.ehmc@harbourmaster.org