Dynamic Vehicle Routing in MATSim (Michał Maciejewski)

More documents

Recommendations

Info

Architecture • Data flows • Allows for offline optimization 1. Run MATSim simulation scenario 2. Process traffic data 3. Run VRP Optimizer with external request data 31
Road network to graph mapping • Input: – road network – locations (depots, customers…) • Output dynamic – graph G= – least-cost arcs • travel distances/costs • travel times • sequence of visited nodes/links (Path in MATSim) • 100 customers + 1 depot 10,100 arcs • 1000 customers + 10 depots 1,019,090 arcs 32
Page 1 and 2: Poznan University of Technology Dep
Page 3 and 4: CVRP • CVRP = Capacitated Vehicle
Page 5 and 6: VRP types • Most popular types (T
Page 7 and 8: Dynamic VRP • DVRP properties (La
Page 9 and 10: Classification of DVRP • Degree o
Page 11 and 12: Agenda • Dynamic Vehicle Routing
Page 13 and 14: Current status for DVRP Optimizer
Page 15 and 16: Route - state diagram 17
Page 17 and 18: Waiting strategies immediate reques
Page 19 and 20: Routes 25
Page 21 and 22: Routes 27
Page 23: Agenda • Dynamic Vehicle Routing
Page 27 and 28: Waiting strategies • Earliest Dep
Page 29 and 30: Route 1 37
Page 31 and 32: Route 1 39
Page 33 and 34: Architecture • Data flows • Bi-
Page 35: Thank you… 43

Dynamic Vehicle Routing in MATSim (Michał Maciejewski)

Create successful ePaper yourself

Delete template?

Save as template?