讲座时间：2014年6月24日（周二）上午10:30
讲座地点：西南交通大学九里校区交通运输与物流学院01109
主讲人简介：聂宇副教授，美国西北大学
Yu (Marco) Nie（聂宇）is an Associate Professor of Civil and Environmental Engineering at Northwestern University. He received his B. S. in Structural Engineering from Tsinghua University, M.S. from National University of Singapore, and Ph.D. from the University of California, Davis. Dr. Nie specializes in modeling and analysis of various transportation systems, ranging from urban highway networks to public transport systems. To date, he has published over fifty peer-reviewed journal articles on related topics. Dr. Nie is a member of TRB committees on Transportation Network Modeling (ADB30) and Traffic Flow Theory and Characteristics (AHB45). He is an associate editor for the Journal of Transportmetrica B, an area editor on sustainable transportation for the Journal of Networks and Spatial Economics, and a member of the Editorial Advisory Board of the Journal of Transportation Research Part B. Dr. Nie’s research has been supported by National Science Foundation, US Department of Transportation, Federal Highway Administration, Illinois Department of Transportation, and Northwestern Institute for Energy and Sustainability.
讲座内容简介：
主题：基于在线信息的公交路线优化 Optimal Transit Routing with Online Information
We study the optimal routing problem in a transit network with online information. By online information, we mean that the arrival time of the incoming transit vehicles is available for a subset of the lines serving a stop. To cope with information availability, a new routing strategy is proposed and closed form formulae for computing expected waiting times and line boarding probabilities are derived. These resultsunify existing hyperpath-based transit route choice models, which typically assume eitherno information or full information at stops. The problem of determining the attractive setis discussed for each of the three information cases. In particular, a new heuristic algorithmis developed to generate the attractive set in the partial information case, which will alwaysyield a solution no worse than that obtained without any information. We showthat, when information is available, an optimal hyperpath may contain cycles. Accordingly,the cause of such cycles is analyzed, and a sufficient condition that excludes cycles from optimalhyperpaths is proposed. Numerical experiments are conducted to illustrate the impact of information availability on expected travel times and transit line load distributions.Among other findings, the results suggest that it is more useful to have information on fasterlines than on slower lines.