報告題目：The Service-Centric Vehicle Routing Problem with Crowdshipping
時間：2024年11月25日上午11:00-12:00
地點：中關村校區主樓216
報告人：章宇
報告人簡介：
章宇，西南財經大學“光華杰出學者計劃”青年杰出教授、博導，國家級青年人才。東北大學本科、直博，新加坡國立大學聯培博士、博后、訪問學者。主要從事物流、供應鏈、交通、醫療等領域中服務運營管理的魯棒優化與決策研究。主持和參與國家自然科學基金項目4項。在Operations Research (UTD24)、Mathematical Programming、Production and Operations Management (UTD24)、INFORMS Journal on Computing (UTD24)、Transportation Science等權威期刊發表學術論文20余篇。獲中國管理科學與工程學會優秀博士學位論文獎、Omega期刊最佳論文獎、上海社科優秀成果二等獎、遼寧自科學術成果三等獎，單篇論文入選ESI高被引論文。兼任中國管理現代化研究會青年工作委員會秘書長、中國系統工程學會物流系統工程分會委員、中國運籌學會決策科學分會理事。為中遠、中煙、重慶電力等做項目咨詢。
報告內容簡介：
Last-mile delivery services worldwide have embraced crowdshipping, which involves both regular and occasional drivers to reduce transportation costs and potentially ensure timely deliveries. However, real-world uncertainty in travel times leads to delays in deliveries. Motivated by empirical studies on customer impatience with late deliveries, this paper focuses on a service-centric Vehicle Routing Problem with Crowdshipping (VRPC) under uncertain travel times. Apart from traditional lateness measures, such as on-time arrival probability and expected lateness, we also consider scenarios where customers show exponential impatience towards lateness. We introduce a novel approach to calibrate the disutility, leading to salient managerial implications and probabilistic insights. We develop an exact branch-price-and-cut algorithm for the deterministic VRPC and a route enumeration-based exact algorithm for the non-convex and non-smooth service-centric VRPC. Numerical studies based on existing instances validate the computational efficiency of the developed algorithms and the efficacy of the newly proposed lateness measures in mitigating the risk of late deliveries.
（承辦：管理工程系、科研與學術交流中心、中國運籌學會數據科學與運籌智能分會（籌））
