Huangdao Business Lecture Series, No. 135
Abstract:
The classical Vehicle Routing Problem (VRP) assumes that each customer is served by exactly one vehicle. When this assumption is relaxed—allowing multiple vehicles to serve a single customer—the problem becomes known as the Split Delivery Vehicle Routing Problem (SDVRP). Although the difference in problem formulation between VRP and SDVRP is subtle, the solution space for SDVRP is significantly larger, thereby increasing both its computational complexity and solution difficulty. This seminar will focus on heuristic and exact algorithms developed to effectively solve the SDVRP.
Speaker Bio:
Professor Qin, from Huazhong University of Science and Technology, is a doctoral advisor whose research focuses on operations optimization, intelligent optimization algorithms, network planning, transportation scheduling, and production planning. He has led three projects funded by the National Natural Science Foundation of China and currently holds one general and one key NSFC project. He has published over 70 papers in SCI/SSCI-indexed journals. Since 2016, he has served as the Secretary-General of the Management Systems Engineering Committee of the Society of Management Science and Engineering. He has been recognized as a “Chutian Scholar” and selected for the Optics Valley 3551 Talent Program in Wuhan and the Jiangsu “Double Innovation” Talent Program. In 2018, he won first place in the JD Global Operations Optimization Challenge. He has led multiple industry-collaboration projects with companies including Huawei, SF Express, and Midea. In 2017, he founded the WeChat public account Data Magician, which has attracted over 70,000 followers and is dedicated to the dissemination and application of operations optimization technologies.
