报告讲座

当前位置: 首页 > 学院要闻 > 报告讲座 > 正文
分类

金建钢:Feeder Vessel Routing and Transshipment Coordination in a Hub-and-Spoke Maritime Shipping Network: A Branch-&-Price Algorithm

报告时间2021515日(周六)上午10:00-11:30

报告地点屯溪路校区三立苑324

报告人金建钢 教授

工作单位上海交通大学船舶海洋与建筑工程学院
举办单位汽车与交通工程学院

个人简介

金建钢,博士,上海交通大学交通运输工程系副教授。分别于清华大学和新加坡国立大学获得学士和博士学位。专注于大规模组合优化、整数规划和网络优化等运筹优化方法在交通和物流系统中的应用研究。在Transportation Science, Transportation Research Part A/B/C/E等期刊上发表30余篇SCI/SSCI期刊论文。主持3项国家自然科学基金项目(中加国际合作研究项目、面上、青年)。入选交通部交通运输青年科技英才、上海市启明星计划、上海市晨光计划。获INFORMS Railway Application Section铁路优化竞赛唯一一等奖、新加坡国立大学校长奖。担任国际期刊Computers & Industrial Engineering领域编辑(Area Editor)。


报告简介

With increasing container-shipping traffic, congestion at transshipment hub ports happens from time to time incurring longer-than-expected waiting time for vessels and loss of transshipment connections. This situation is even worse for feeder companies, due to their relatively lower berthing priority. It is essential to design the feeder vessel routes and schedules in response to hub port congestion while ensuring efficient transshipment connection. In this paper, we study, for a feeder liner company, the vessel routing and transshipment coordination problem with limited choices of berthing time slots. We propose a set covering model with the objective of minimizing total operational cost and transshipment connection cost. A branch-&-price exact algorithm is developed, which can solve instances with up to 30 ports to optimality within one hour. Computational results based on a real-world shipping network demonstrate that, by integrating the hub port visiting time decision with feeder vessel routing, transshipment coordination can be significantly enhanced even under hub port congestion situations.


上一条:傅惠: 城市交通大数据分析与仿真应用 下一条:田大新:车路云感传一体化系统及其在交通领域的应用实践

关闭