Preferred citation style - MATSim

More documents

Recommendations

Info

Understanding supply Slot: A path in the time-space environment, which allows moving or activity performance • Regulated slots (e.g. table in a restaurant, reserved seat in a theatre, gate position of a plane, green light at a junction) • Emergent slots (e.g. trajectory of a car on a motorway, players in a pub-soccer tournament) Waiting time ~ Reserve capacity = Capacity – Demand for slots 14
What do we (generally) do ? “Scenario” Competition for slots on networks and in facilities k(t,r,j) i,n q i _ (t,r,j) i,n Mental map Activity scheduling Population _i,t, r,j,k Demand q are the i th movements of person p from the current location at time t on route (connection) r to location j. The resulting generalised costs k are used to adjust the schedules and to change the capacities C and prices P of facilities f 15
Page 1 and 2: Preferred citation style MATSim dev
Page 3 and 4: Overview • Structure and team •
Page 5 and 6: Current team Strategy: • Kai Nage
Page 7 and 8: Current team: Implementation (2/2)
Page 9 and 10: Task and solution methods 9
Page 11 and 12: What would we like to do ? Personal
Page 13: Degrees of freedom of activity sche
Page 17 and 18: MATSIM-T aims (1): Steady-state ver
Page 19 and 20: System architecture • XML standar
Page 21 and 22: Architecture: Data flow JAVA C++ 21
Page 23 and 24: Current task allocation: activity s
Page 25 and 26: Result of each iteration: Plan
Page 27 and 28: Utility function: Individual schedu
Page 29 and 30: 29 Utility function: Late arrival (
Page 31 and 32: Scheduling: Current planomat(s) Ver
Page 33 and 34: CH: Facilities for 140!000 hectares
Page 35 and 36: CH: Network Simplification: Results
Page 37 and 38: CH: Mobility tools Approach: Data:
Page 39 and 40: CH: Activity location choice Home:
Page 41 and 42: R: Hectare; M: Municipality CH: Kt.
Page 43 and 44: CH: Kanton Zürich 43
Page 45 and 46: CH: Kanton Zürich (planomat - Iter
Page 47 and 48: B/B: Population and demand • Gene
Page 49 and 50: B/B: Tolling in Berlin/Brandenburg
Page 51 and 52: B/B: total trip lengths with distan
Page 53 and 54: Current tasks: Functionality • Im
Page 55 and 56: Current tasks: Usability (Shareabil
Page 57 and 58: Acknowledgements (2/3) Router: Nico
Page 59 and 60: More information www.matsim.org www
Page 61 and 62: Speed-up Basic algorithm: A* Step 1
Page 63 and 64: Speed up of shortest-path calculati
Page 65 and 66:
Approach Resolution physical (VISSI
Page 67 and 68:
Q-event: Approach without gaps t Li
Page 69 and 70:
Q-event: Implementation details •
Page 71 and 72:
Q-event: Test setup • Road networ
Page 73 and 74:
Q-event: Parallelisation
Page 75 and 76:
Initial approach Method: • Plan e
Page 77 and 78:
Impact of improved approach 77
Page 79 and 80:
What should we do, when we do what
Page 81 and 82:
What would we like to do ? Personal
Page 83 and 84:
Architecture: Learning, search for
Page 85 and 86:
CH: Mode choice - Observed share pu
Page 87 and 88:
CH: Facilities - Data sources Three
Page 89 and 90:
CH: Facilities - results 89
Page 91:
CH: Facilities - results 91
show all

Preferred citation style - MATSim

Create successful ePaper yourself

Delete template?

Save as template?