运作管理学术论坛（01）：储诚斌教授

时间：2025-07-01

报告人：储诚斌教授 （法国）

报告题目：Effective and robust GA and exact algorithms for passenger-goods shared transport in urban rail networks

报告时间：2025年7月2日（周三）上午9:30-11:00

报告地点：劝学楼425室

主办单位：运作管理与优化决策研究团队

报告人简介：储诚斌教授是法国艾菲尔大学教授，国家高层次人才计划入选者。1985年毕业于合肥工业学工业自动化专业, 于1990年梅斯大学博士学位。1992年任法国国家信息及自动化研究院终身研究员。1996年任职特鲁瓦工业大学，创建和领导的工业系统优化实验室称为法国国家重点实验室。2008至2017年任职巴黎中央理工大学（Ecole Centrale Paris，现任巴黎-萨克雷大学中央理工-高等电力学院CentraleSupélec，Université Paris-Saclay）供应链管理讲席教授。储教授的研究领域集中在生产和物流系统优化，发表280多篇国际期刊论文，其中2篇获最佳论文奖。主持20多项欧盟、法国中央、地方政府和企业研究项目，总经费近1000万欧元；研究成果在数十家企业和多个行业得到应用。由于他在理论创新及实际应用方面的突出贡献，他在1996年就荣获法国运筹学和辅助决策领域的最高奖项Robert Faure一等奖。此外，他曾任西安交通大学海外讲座教授﹑工业工程系海外系主任；同济大学讲座教授、中国科技大学客座教授，并入选陕西省“千人计划”，与西北工业大学开展合作。为中国高校培养了多名优秀的博士，成为国家级领军人才和青年领军人才。

报告摘要：In this talk, we consider freight transport in urban areas using passenger rail networks as an environment-friendly alternative to current predominantly fossil-fueled trucks. We focus on designing an effective and robust method based on genetic algorithm. The problem is mathematically formulated into a mixed-integer linear program. We prove that as long as a parcel-to-train assignment is known, it takes a polynomial time to check whether this assignment can lead to a feasible solution and, if yes, solve the remaining problem by transforming it into computing the longest distances in a digraph. This result makes it possible to only consider parcel-to-train assignment variables in chromosomes, while efficiently determining the values of the other variables in fitness evaluation. In order to achieve robustness regarding all instances, the control parameters of the genetic algorithm are set with Taguchi method. Computational results show that the method developed in this way is very effective. For small-size instances, it yields optimal solutions within considerably shorter computation times than a commonplace optimization solver does. For large-size instances, it outperforms such a solver, not only providing much higher-quality solutions but also consuming much shorter computation times. This method thus meets very well operational requirements where high-quality solutions are expected while computation time is very limited. We also show that the problem as well as the pricing problem in the branch-and-price framework can be solved with Benders decomposition where the slave problem can be exactly solved with Bellman-Ford method.

撰稿：赵永丽      审核：吴志樵  印明鹤       单位：管理科学与工程学院