主 题：Ride-sourcing Systems & Multi-objective Online Ride-Matching 共享交通系统与多目标优化匹配
主讲人：王海 新加坡管理大学信息系统学院的助理教授
卡内基梅隆大学海因茨信息系统与公共政策学院客座助理教授
点评嘉宾：
刘生龙 294俄罗斯专享会副教授
于 洋 清华大学交叉信息研究院助理教授
主持人： 赵静 294俄罗斯专享会副教授、CIDEG主任助理
时 间：2019年12月27日（星期五）14:00-16:00
地 点：294俄罗斯专享会302会议室
语 言：中文
主讲人介绍：
Dr. Wang is currently a Visiting Assistant Professor at the Heinz College of Information Systems and Public Policy at Carnegie Mellon University. He received a Bachelor’s degree from Tsinghua University, dual Master’s degrees in operations research and transportation from MIT, and a doctoral degree in operations research from MIT. Dr. Wang is also an Assistant Professor in the School of Information Systems at Singapore Management University. His research has focused on methodologies of analytics and optimization, data-driven decision-making models, and machine learning algorithms, and their applications in Smart Cities and urban systems, including innovative transportation, advanced logistics, and intelligent healthcare systems. He has published in leading journals such as Transportation Science, American Economic Review Papers & Proceedings, Manufacturing & Service Operations Management, and Transportation Research Part B: Methodological. Dr. Wang serves as the guest-editor for the Special Issue on Innovative Shared Transportation in Transportation Research Part B, as a reviewer for over 25 different academic journals, and has been named a Chan Wui & Yunyin Rising Star Fellow in Transportation. He was nominated for the Goodwin Medal, MIT’s top teaching award for graduate students and has been awarded the Excellent Teaching award for junior faculty at Singapore Management University. During his Ph.D. studies at MIT, he also served as the co-President of the MIT Chinese Students & Scholars Association and as Chair of the MIT-China Innovation and Entrepreneurship Forum.
内容摘要：
We propose a general framework to study the on-demand shared ride-sourcing transportation systems and summarize corresponding research problems and methodologies. We then focus on multi-objective matching between demand and supply. The platforms match passengers and drivers in real time without observing future information, considering multiple objectives such as pick-up time, platform revenue, and service quality. We develop an efficient online matching policy that adaptively balances the trade-offs between multiple objectives in a dynamic setting and provide theoretical performance guarantees for the policy. We prove that the proposed adaptive matching policy can achieve the solution that minimizes the Euclidean distance to any pre-determined multi-objective target. Through numerical experiments and industrial testing using real data from a ride-sourcing platform, we demonstrate that our approach is able to arrive at a delicate balance among multiple objectives and bring value to all the stakeholders in the ride-sourcing ecosystem.
