<node id="653069">
  <nid>653069</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1637594294</created>
  <changed>1637594294</changed>
  <title><![CDATA[PhD Defense by Rafegh Aghamohammadi]]></title>
  <body><![CDATA[<p><strong>School of Civil and Environmental Engineering</strong></p>

<p><strong>Ph.D. Thesis Defense Announcement</strong>&nbsp;</p>

<p>Macroscopic Urban Network Dynamics: Estimation and Applications</p>

<p>&nbsp;</p>

<p><strong>By:</strong>&nbsp;</p>

<p>Rafegh Aghamohammadi</p>

<p>&nbsp;</p>

<p>&nbsp;<strong>Advisor:</strong>&nbsp;</p>

<p>Dr. Jorge A. Laval (CEE)</p>

<p>&nbsp;</p>

<p>&nbsp;<strong>Committee Members:</strong>&nbsp;</p>

<p>Dr. Srinivas Peeta (CEE), Dr. Patricia Mokhtarian (CEE),</p>

<p>Dr. David Goldsman (ISyE), Dr. Guanghui Lan (ISyE)</p>

<p><strong>&nbsp;</strong></p>

<p><strong>Date &amp; Time:</strong>&nbsp;</p>

<p>Friday, December 3<sup>rd</sup>, 2021, at 11 AM (EST)</p>

<p>&nbsp;</p>

<p><strong>Location:</strong>&nbsp;&nbsp;</p>

<p><strong>In-person:</strong> Sustainable Education Building (SEB) 122</p>

<p><strong>Virtual:</strong> <a href="https://PhDdefense.rafegh.me">https://PhDdefense.rafegh.me</a></p>

<p>During the past decade there has been significant research efforts in developing traffic control and management<br />
methods based on an aggregated representation of traffic networks. In fact, the traditional link-level network<br />
representation imposes prohibitive computational costs for typical large-scale urban networks. Thankfully, it has<br />
been observed that at a macroscopic level, the relationship between any pair of network-average traffic variables<br />
can be described by simple functions called macroscopic fundamental diagrams (MFD). However, current MFD<br />
estimation methods were mainly conceived for individual arterial corridors and their application to urban networks<br />
has not been validated using extensive empirical data.<br />
This dissertation fills this gap by extending current MFD estimation methods to large-scale real-life networks,<br />
while using empirical data from 41 cities around the world for calibration and validation. This dissertation further<br />
investigates the efficient application of MFD in travelers&#39; route choice using the dynamic traffic assignment (DTA)<br />
methods and sets forth the discrete- and continuum-space DTA approaches are intrinsically similar and can be<br />
seen as equivalents on different aggregation levels, although they previously seemed to be the two extreme ends<br />
of the macroscopic DTA spectrum. A novel continuum-space DTA modeling framework consistent with the MFD<br />
theory and assumptions has been developed and a semi-Lagrangian solution method has been proposed by<br />
splitting up the network into smaller zones, which can be implemented for minimizing either the travel times of<br />
individual users or the total travel time of all users in the network. Finally, the potentiality of implementing the<br />
MFD in microscopic vehicular emissions estimation models has been explored.<br />
The major findings of this dissertation are as follows. The empirical MFD validation results identify the most<br />
important challenges in both analytical and empirical MFD estimation approaches as: (i) the distribution of loop<br />
detectors within the links, (ii) the distribution of loop detectors across the network, and (iii) the treatment of<br />
unsignalized intersections and their impact on the block length. The numerical experiment results using the<br />
proposed DTA framework indicate that partitioning the network into a finer grid of zones can yield more accurate<br />
results with respect to the approximated analytical solutions without significant loss of efficiency and demonstrate<br />
the potential of application of this framework for real-life networks with arbitrary network and zone shapes. The<br />
comparison between the results and runtimes of the emissions estimations conducted in 4 different aggregation<br />
levels: lane, link, corridor, and network, reveals that the efficiency can be significantly improved by utilizing more<br />
aggregated network representation under some considerations. This will make the MFD a powerful tool for real-<br />
time emissions estimation and control.<br />
http://PhDdefense.rafegh.me</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Macroscopic Urban Network Dynamics: Estimation and Applications]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2021-12-03T11:00:00-05:00]]></value>
      <value2><![CDATA[2021-12-03T13:00:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[https://PhDdefense.rafegh.me]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
