BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260413T151749Z
UID:Seminar-dept-316@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20130402T160000
DTEND:20130402T170000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Tobias Harks: Computing Network Tolls with Support Constraints\n\nReducing traffic congestion via toll pricing has been a central topic in the operations research and transportation literature and, recently, it has been implemented in several cities all over the world. Since in practice it is not feasible to impose tolls on every edge of a given traffic network, we study the resulting mathematical problem of computing tolls on a predefined subset of edges of the network so as to minimize the total travel time of the induced equilibrium flow. We first present an analytical study for the special case of parallel edge networks highlighting the intrinsic complexity and non-convexity of the resulting optimization problem. We then present algorithms for general networks for which we systematically test the solution quality for large-scale network instances.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=316
LOCATION:G12
END:VEVENT
END:VCALENDAR