BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Traffic signal control and route choice\, capacity maximization an
 d stability
DTSTART:20150306T121500
DTEND:20150306T131500
DTSTAMP:20260916T043451Z
UID:f242f77ab3231a2e812673839c949c50b23c88f9c63cc900b2883b44
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Dr Mike Smith\, University of York\, England\nThe talk w
 ill have two parts: A\, B.\nPART A: [Routeing + control] dynamics with jus
 t flows and green-times.\nThis talk outlines the P0 control policy in a mo
 del without queues. It is shown that under certain conditions this policy 
 maximises network capacity.\nNatural dynamical flow-only models of day-to-
 day re-routeing (drivers swap to quicker routes) is combined with day to d
 ay green-time response based on the responsive control policy P0 (see Smit
 h (1979\, 1980\, 1987). It is shown that\, for any steady feasible demand 
 within this dynamical flow + control model\, any (flow\, green-time) solut
 ion trajectory cannot leave the region of supply-feasible (flow\, green-ti
 me) pairs\, costs are bounded\, and throughput is maximised.\nPART B: [Rou
 teing + control] dynamics with flows and green-times and queues.\nIt will 
 then be shown that\, within a model with explicit queues\, modified Varaiy
 a (2013) and Le at al (2013) control policies do not have the above proper
 ties. We give a network and a steady demand within the capacity of the net
 work for which there is no equilibrium consistent with either policy\; in 
 each case a dynamical [routeing + control] model has unbounded queues.\nTh
 e paper shows that\, in contrast\, responsive P0 on this example network d
 oes give rise to a consistent equilibrium and a dynamical [routeing + cont
 rol] model has bounded queues. (One possible extension of P0 ideas to incl
 ude Macroscopic Fundamental Diagrams may be described briefly).\nBio :\nMi
 ke is Emeritus Professor of Mathematics at the University of York\; he was
  awarded the Robert Herman Lifetime Achievement Award in 2007 for his work
  on the Mathematics of Transport.\nMike entered the University of York as 
 a lecturer in Mathematics in 1964. Soon after\, the construction of a wide
  ring road close to York City Centre (and the demolition of 450 houses) wa
 s proposed to reduce congestion in York.\nMike’s first paper (“Traffic
  control in a town with two ring roads”) was published in 1974. This sho
 wed how traffic control could be used to reduce congestion in York without
  constructing a wide inner ring and without demolishing houses.\nIn 1979 /
  1980 Mike published a paper called “A Local Traffic Control Policy whic
 h Automatically Maximises the Overall Travel Capacity of a Road Network”
 . Since then he has spent many years extending this “magic” policy (ca
 lled P0)\; showing how traffic control may be used to reduce congestion wi
 thin an existing road network\; while taking account of route choices.
LOCATION:GC B3 30 http://plan.epfl.ch/?lang=fr&room=GCB330
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR