000163210 001__ 163210
000163210 005__ 20180317094012.0
000163210 037__ $$aPOST_TALK
000163210 245__ $$a Simulation-based dynamic traffic assignment is not a black box
000163210 269__ $$a2011
000163210 260__ $$c2011
000163210 336__ $$aTalks
000163210 520__ $$a The dynamic traffic assignment (DTA) problem is to find the state of a transportation system where demand (travel behavior) and supply (network performance) are mutually consistent. The difficulty of solving this problem with mathematical rigor led to the development of microsimulation-based solution procedures. Microsimulations bring along vastly increased descriptive capabilities, but their equally increased complexity often motivates both practitioners and researchers to treat them as black box systems. This presentation demonstrates how the structure of the DTA problem can be exploited when dealing with microsimulations. The findings are made concrete in the context of a DTA calibration problem.  
000163210 700__ $$0243042$$aFlötteröd, Gunnar$$g188382
000163210 7112_ $$a internal seminar$$c Massachusetts Institute of Technology, Cambridge MA, USA$$dJanuary 07, 2011
000163210 909CO $$ooai:infoscience.tind.io:163210$$pENAC$$ppresentation
000163210 909C0 $$0252123$$pTRANSP-OR$$xU11418
000163210 937__ $$aEPFL-TALK-163210
000163210 970__ $$aTALK-FloeBoston2011/TRANSP-OR
000163210 973__ $$aEPFL$$sPUBLISHED
000163210 980__ $$aTALK