主讲人：Andrea D’Ariano

邀请人：曾小清教授

时间：2023年10月21日（周六）下午15:00-17:00

地点：通达馆103会议室

主讲人简介：

Andrea D’Ariano received the B.S. and M.S. degrees in Computer Science and Automation Engineering at Roma Tre University. In November 2003, he joined TRAIL Research School and Department of Transport and Planning, Faculty of Civil Engineering and Geosciences, Delft University of Technology. In April 2008, he successfully concluded his Ph.D. studies. In 2018 and 2022, he got the Full Professor Italian Scientific Habilitation in Operations Research and Transportation Science. He served as Expert and Rapporteur for European Commission and numerous national research foundations. Currently, he is working as Full Professor in Operations Research at Department of Civil, Computer Science and Aeronautical Technologies Engineering, Roma Tre University. He is the coordinator of the AIRO (Italian Association of Operations Research) Chapter on “Optimization in Public Transport and Shared Mobility”. His main research interest is the development of novel scheduling and routing methods with application to transportation and logistics.

主讲内容简介：

Railway dispatchers reschedule trains in real-time in order to limit the propagation of disturbances and to regulate traffic in their respective dispatching areas by minimizing the deviation from the off-line timetable. However, the decisions taken in one area may influence the quality and even the feasibility of train schedules in the other areas. Regional control centers coordinate the dispatchers’ work for multiple areas in order to regulate traffic at the global level and to avoid situations of global infeasibility. Differently from the dispatcher problem, the coordination activity of regional control centers is still underinvestigated, even if this activity is a key factor for effective traffic management.

This talk investigates the problem of coordinating several dispatchers with the objective of driving their behavior towards globally optimal solutions. With our model, a coordinator may impose constraints at the border of each dispatching area. Each dispatcher must then schedule trains in its area by producing a locally feasible solution compliant with the border constraints imposed by the coordinator. The problem faced by the coordinator is therefore a bilevel programming problem in which the variables controlled by the coordinator are the border constraints. We demonstrate that the coordinator problem can be solved to optimality with a branch and bound procedure. The coordination algorithm has been tested on a large real railway network in the Netherlands with busy traffic conditions. Our experimental results show that a proven optimal solution is frequently found for various network divisions within computation times compatible with real-time operations.

欢迎各位老师、同学参加院级高等讲堂！

tyc8722太阳集团城研究生会
tyc8722太阳集团城青年教师沙龙