1 / 91

Preferred citation style

Preferred citation style. MATSim development team (ed.) (2007) MATSIM-T: Aims, approach and implementation , IVT, ETH Zürich, Zürich. MATSIM-T: Aims, approach and implementation. August 2007. Overview. Structure and team Task and solution methods MATSIM aims System architecture Examples

cissy
Télécharger la présentation

Preferred citation style

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Preferred citation style • MATSim development team (ed.) (2007) MATSIM-T: Aims, approach and implementation, IVT, ETH Zürich, Zürich.

  2. MATSIM-T: Aims, approach and implementation August 2007

  3. Overview • Structure and team • Task and solution methods • MATSIM aims • System architecture • Examples • Switzerland • Berlin/Brandenburg • Outlook and next steps • Progress on shortest path calculations • Traffic flow model • Improving the convergence

  4. Structure • Software: • Open-source project under GNU public licence • Coordination: • Kai Nagel, TU Berlin • Data: • Public sources, where available • Private sources, when needed or as occasion arises

  5. Current team • Strategy: • Kai Nagel, TU Berlin • Kay Axhausen, ETH Zürich • Fabrice Marchal, LET, Lyon • Coordination of the implementation and project management: • Michael Balmer, ETH Zürich • Marcel Rieser, TU Berlin

  6. Current team: Implementation (1/2) • Michael Balmer, ETH • David Charypar, ETH • Francesco Ciari, ETH • Dominik Grether, TU Berlin • Jeremy Hackney, ETH • Andreas Horni, ETH • Gregor Lämmel, TU Berlin • Nicolas Lefebvre, ETH • Michael Löchl, ETH

  7. Current team: Implementation (2/2) • Fabrice Marchal, LET • Konrad Meister, ETH • Kai Nagel, TU Berlin • Marcel Rieser, TU Berlin • Nadine Schüssler, ETH • David Strippgen, TU Berlin

  8. Current funding sources • Basic research support for the chairs • (competitive) ETH research fund • Swiss National Fund • German Research Society • EU Framework funding • VW Foundation • Swiss Commission for Technology and Information (KTI) (datapuls, Lucerne)

  9. Task and solution methods

  10. Personal world What we would like to do ? Social captial: stock of joint abilities, shared histories and commitments Personal worlds of others Biography Projects Learning Household locations Social network geography Mobility tools

  11. What would we like to do ? Personal daily dynamics ................ Activity repertoire (t) Activity repertoire (t+1) Physiological needs Commitments Desires Pending activities Activity calendar (t) Unexecuted activities Updates, Innovations Activity schedule (t) Rescheduling, Execution Scheduling Networks, Opportunities ................ Mental map (t) Mental map (t+1)

  12. Understanding scheduling • Budget constraints • Capability constraints • Generalised costs of the schedule • Generalised cost of travel • Generalised cost of activity participation • Risk and comfort-adjusted weighted sums of time, expenditure and social content

  13. Degrees of freedom of activity scheduling • Number and type of activities • Sequence of activities • Start and duration of activity • Composition of the group undertaking the activity • Location of the activity • Connection between sequential locations • Location of access and egress from the mean of transport • Vehicle/means of transport • Route/service • Group travelling together

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

  15. What do we (generally) do ? Population “Scenario” βi,t, r,j,k k(t,r,j)i,n Mental map Competition for slots on networks and in facilities Activity scheduling qi ≡ (t,r,j)i,n Demand q are the ithmovements 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

  16. Classification criteria • Steady state (equilibrium) ? • Aggregate demands ? • Complete and perfect knowledge ? • Optimised schedules ? • Degrees of freedom and detail of scheduling • Modelling of capacity restrictions (movement, activities) ?

  17. MATSIM-T aims (1): Steady-state version • Steady state within 12 hours on a small multi-CPU machine • 7.5 mio agents, parcels, navigation networks • Shared time-of-day dependent generalised costs of travel and activity participation • Optimised schedules • Continuous time resolution; space: parcels; social networks • Queuing for slots for movement and activities

  18. MATSIM-T aims (2): Path-dependent version • Path-dependent development; precise estimates within 12h on a small multi-CPU machine • Large scale scenario • Agent-specific, learned time-of-day dependent generalised cost of travel and activity participation • Optimised schedules at multiple decision points • Continuous time resolution; space: parcels; social networks • Queuing for slots for movement and activities

  19. System architecture • XML standards • Data handling tools (aggregation/disaggregation) • Data base • Iteration handling and control of convergence • Models

  20. Architecture: JAVA - packages

  21. Architecture: Data flow • JAVA C++

  22. Current task allocation: Initial demand generation • Number and type of activities • Sequence of activities • Start and duration of activity • Composition of the group undertaking the activity • Location of the activity • Connection between sequential locations • Location of access and egress from the mean of transport • Vehicle/means of transport • Route/service • Group travelling together

  23. Current task allocation: activity scheduling • Number and type of activities • Sequence of activities • Start and duration of activity • Composition of the group undertaking the activity • Location of the activity • Connection between sequential locations • Location of access and egress from the mean of transport • Vehicle/means of transport • Route/service • Group travelling together

  24. Current ability: competition for slots • Shortest paths: • A* dynamic algorythm • Movement: • Queue-based simulation of car traffic • No representation of cycling, walking, public transport vehicles • Activities • No competition for facilities yet

  25. Result of each iteration: Plan • <person id="22018"> • <plan score="157.72" selected="yes"> • <act type="h" x="703600" y="236900" link="5757" end_time="07:35:04" /> • <leg num="0" mode="car" dep_time="07:35:04" trav_time="00:16:31"> • <route>1900 1899 1897</route> • </leg> • <act type="w" x="702500" y="236400" link="5749" dur="08:12:05" /> • <leg num="1" mode="car" dep_time="16:03:40" trav_time="01:10:22"> • <route>1899 1848 1925 1924 1923 1922 1068</route> • </leg> • <act type="l" x="681450" y="246550" link="2140" dur="01:20:00" /> • <leg num="2" mode="car" dep_time="" trav_time="00:34:35"> • <route>1067 1136 1137 1921 1922 1923 1925 1848 1899</route> • </leg> • <act type="h" x="703600" y="236900" link="5757" /> • </plan> • </person>

  26. Scheduling and its utility function

  27. Utility function: Individual schedules

  28. Utility function: Travel

  29. Utility function: Late arrival

  30. Utility function: Activity performance

  31. Scheduling: Current planomat(s) • Version 1: • GA optimiser of durations and starting times • Retains time-of-day profile of generalised costs • Version 2: • CMA-ES (Covariance Matrix Adaptation Evolutionary strategy) of durations and starting times • Retains time-of-day profile of generalised costs

  32. Examples (scenarios): • CH: Switzerland and subsets • Base tests for Kanton Zürich • B/B: Berlin/Brandenburg • Tolling case studies

  33. CH: Facilities for 140’000 hectares • <facilities name="Swiss National Enterprise Census"> • <facility id="101" x="606300" y="281549"> • <activity type="shop"> • <capacity value="50"/> • <opentime day="wkday" start_time="8:00:00" end_time="19:00:00" /> • <opentime day="sat" start_time="8:00:00" end_time="16:00:00" /> • </activity> • <activity type="work"> • <capacity value="5" /> • <opentime day="wkday" start_time="8:00:00" end_time="19:00:00" /> • <opentime day="sat" start_time="8:00:00" end_time="16:00:00" /> • </activity> • </facility> • </facilities>

  34. CH: Comparisons at the aggregate levels

  35. CH: Network • Simplification: • Remove unconnected links and subnetworks • Remove nodes between unchanging link types • Cut off dead ends • Results: • Navteq (882’120 links) (25% loss of links/nodes) • Teleatlas (1’288’757 links) (currently not in use)

  36. CH: Population • Alternatives: • Artificial sample generation from Census marginals • Census • Private census with additional imputations (datapuls, Lucerne) plus household “formation”

  37. CH: Mobility tools • Approach: • MNL of mobility tool packages (Beige) • Socio-demographics • Location types • Travel times to main centre by road and public transport • Data: • National travel survey (MZ 2000)

  38. CH: Structure of the chains, activity durations • Data • MZ 2000 • MZ 2005 • Approach: • Selection via conditional probability distribution from Chains * Person types frequencies • ca. 50 activity chains for MZ 2000 (>95% of all cases) • Specified with activity durations given by MZ 2000  xxxx different activity chains (weighted)

  39. CH: Activity location choice • Home: • Random location in hectare • Work/school • Random allocation from census commuter matrices • Disaggregation to facilities inside municipality • Other locations • “Neighbourhood search” from given home/work/school locations (a variation of Gravity Model)

  40. CH: Mode choice • Approach: • Fixed mode choice at the tour level as a function of • Driving licence • Mobility tool ownership • Distance • Age * season ticket • Current set of chains include no subtours • Data: • MZ 2005

  41. CH: Kt. Zürich – Basic test R: Hectare; M: Municipality

  42. CH: Kt. Zürich

  43. CH: Kanton Zürich

  44. CH: Kanton Zürich (planomat - Iteration 0)

  45. CH: Kanton Zürich (planomat - Iteration 400)

  46. B/B: Network • Source: “Senatsverwaltung für Stadtentwicklung Berlin” • 11596 nodes • 27770 links

  47. B/B: Population and demand • Generated from “Kutter-Nachfragemodell für Berlin”, • only commuters (work, education) in Berlin/Brandenburg, • only car-trips simulated, • 10% sample: 160’171 agents, each with 2 trips • Facilities = traffic analysis zones

  48. B/B: Tolling in Berlin/Brandenburg • Scenario: As described above • Aims: Impacts of distance and area tolls

  49. B/B: Tolling in Berlin/Brandenburg

  50. B/B: Trip length within toll area with distance tolls

More Related