讲座题目：PenaltyDecompositionApproaches toLargeScaleSecondBestCongestionPricing

主讲人：郭 磊 华东理工大学

讲座时间：2022年12月28日（周三）16:00－17:30

腾讯会议：521-470-033

内容摘要

The second-best congestion pricing (SBCP) problem as an instance of bilevel program models is one of the most challenging problems in transportation. Different from the ordinary nonlinear programs, the bilevelmodel of SBCP involves a two-level hierarchical structure which makes it extremely difficult to design and analyze solution methods. All existing solution methods are heuristic without convergence guarantee and/or suitable for small networks under strong assumptions. This paper focuses on efficiently solving large scale SBCP with theoretical guarantee. We first reveal some implicit structure properties based on the marginal value function reformulation. Two dedicated penalty decomposition algorithms are then proposed by effectively exploiting these revealed properties. Convergence of the proposed algorithms is established under some commonly used conditions in transportation. The numerical results on a public network test collection validate our theoretical conclusions and demonstrate the practical potential of the proposed algorithms especially for large scale SBCP.

主讲人简介

郭磊，华东理工大学副教授、特聘研究员。2013年于大连理工大学获得博士学位，2014-2015年在加拿大维多利亚大学做博士后研究，2015-2019年就职于上海交通大学任助理教授、副教授。研究方向为最优化及其在运筹学中的应用，共发表SCI/SSCI期刊论文26篇，其中在Mathematical Programming、Mathematics of Operations Research、SIAM系列期刊、Transportation Research Part B等国际权威期刊发表论文10余篇。主持或结题国家自然科学基金项目3项、省部级基金项目3项。