报告题目：A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems

报告摘要：The continuous network design problem (CNDP) has been recognized as one of the most challenging issues in the field of transportation. Existing approaches to solving the CNDP are primarily heuristic without convergence guarantee or suitable for handling small networks because of the inherent nonconvexity arising from its bilevel hierarchical structure. An efficient and convergent approach for solving the CNDP on large networks has been fervently sought.

In this talk, we present a novel convergent approach centered around exploiting the inherent convexity-related structure within the CNDP. We first demonstrate that the CNDP can be equivalently formulated as a difference of convex (DC) program with all involved functions being either convex functions or DC functions. Then by exploiting the DC structure, we give a convex programming approximation for the CNDP and subsequently propose a penalized sequential convex programming approach. Finally, we show that the proposed method can yield an approximately stationary point under commonly used conditions. A numerical study is conducted on some real networks from a reputable network repository for transportation research. The numerical results demonstrate that the proposed method achieves better solutions with faster computational speed, particularly on larger networks, as compared to two heuristic approaches and two convergent approaches.

报告人简介：郭磊，华东理工大学研究员。2013年获大连理工大学运筹学与控制论专业博士学位；2013-2015年在上海交通大学做师资博士后研究；2015-2019年任职于上海交通大学，任助理研究员、副研究员；2019年起入职华东理工大学，任研究员。研究兴趣为最优化理论与方法及其在交通管理与供应链管理中的应用。截至目前发表论文30余篇，其中在Mathematical Programming、Mathematics of Operations Research、INFORMS Journal on Computing、SIAM系列期刊、Transportation Research Part B等运筹学国际顶级期刊上发表论文12篇。主持（过）国家自科基金面上与青年项目3项，省部级基金项目3项；作为骨干成员参与国家自科基金重点项目2项。入选国家青年高层次人才计划；曾荣获辽宁省优秀博士学位论文、上海市哲学社会科学优秀成果奖等。