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 mathematician Al- Chwarizmi يمزراوخلا ىسوم نب دمحم ) is a finite set of instructions, typically to solve a class of problems or perform a computation ” Wikipedia 2019 | 3 20 augustus 2019
Dijkstra’s Algorithm - Edsger Wybe Dijkstra - From Rotterdam - Dijkstra Algorithm / Shortest Path Algorithm “Invented” in1956 and published in 1959 - - 20 Minutes "Computer Science is no more about “The question of whether Machines Can Think... is about computers than astronomy is about as relevant as the question of whether Submarines Can telescopes." Swim” | 4 20 augustus 2019
Dijkstra ’ s Algorithm Google Maps (initially) TomTom (initially) Booking Tickets (lowest costs) Optimization Problems (Mostly minimization) | 5 20 augustus 2019
Dijkstra’s Algorithm visited nodes: (A) ∞ F Start Node – Goal Node 1. 2 ∞ ∞ Nodes (“vertices”) 2. 5 3 B D Paths (“edges”) 3. 6 10 “Distances” 4. ∞ 11 ∞ 3 5. Infinity on nodes, except for the C 4 G starting node. 6. Visited nodes list 3 8 ∞ 5 0 A A E 7 | 6 20 augustus 2019
Dijkstra’s Algorithm visited nodes: (A) visited nodes: (A, B, C, D, E) visited nodes: (A, B, C, E) visited nodes: (A, B, C) visited nodes: (A, C) visited nodes: (A, B, C, D, E, F) ∞ 11 F F Start Node – Goal Node 1. 2 ∞ 14 9 4 Nodes (“vertices”) 2. 5 3 B B D D Paths (“edges”) 3. 6 10 “Distances” 4. 11 ∞ 3 12 3 5. Infinity on nodes, except for the C C 4 G starting node. 6. Visited nodes list 3 8 5 7 0 A A E E 7 | 7 August 20, 2019
Dijkstra’s Algorithm ∞ Potential Problems F f 2 ∞ ∞ “Broken” Network 5 3 B / / D No Data ERROR! Incomplete Data 6 10 ∞ 11 ∞ 3 C 4 G f Unclear Definitions F or f 3 8 ∞ 5 2x f 0 A E 7 | 8 20 augustus 2019
Real World 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! | 9 20 augustus 2019
Smart Algorithms Algorithm (or Physical internet) Data Standards Goal https://portcalloptimization.org/ | 10 20 augustus 2019
Smart Algorithms “Aim for brevity while avoiding jargon” September 5, 1996 11
Ben van Scherpenzeel Pieter de Waard Taskforce Port Call Optimization Port of Rotterdam scherpenzeel@.ehmc@harbourmaster.org Corporate Strategy pieter.dewaard@portofrotterdam.com | 12 20 augustus 2019
Recommend
More recommend
