報告時間：2023年7月13日（星期四）20:00-22:00
報告地點(diǎn)：三立苑324室
報 告 人：李紀(jì)柳 教授
工作單位：西北工業(yè)大學(xué)
舉辦單位：汽車與交通工程學(xué)院
報告簡介：
We present a new exact algorithm to solve a challenging vehicle routing problem with split pickups and deliveries, named as the single-commodity split-pickup and split-delivery vehicle routing problem (SPDVRP). In the SPDVRP, any amount of a product collected from a pickup customer can be supplied to any delivery customer, and the demand of each customer can be collected or delivered multiple times by the same or different vehicles. The vehicle fleet is homogeneous with limited capacity and maximum route duration. This problem arises regularly in inventory and routing rebalancing applications, such as in bike-sharing systems, where bikes must be rebalanced over time such that the appropriate number of bikes and open docks are available to users. The solution of the SPDVRP requires determining the number of visits to each customer, the relevant portions of the demands to be collected from or delivered to the customers, and the routing of the vehicles. These three decisions are intertwined, contributing to the hardness of the problem. Our new exact algorithm for the SPDVRP is a branch-price-and-cut algorithm based on a pattern-based mathematical formulation. The SPDVRP relies on a novel label-setting algorithm used to solve the pricing problem associated with the pattern-based formulation, where the label components embed reduced cost functions, unlike those classical components that embed delivered or collected quantities, thus significantly reducing the dimension of the corresponding state space. Extensive computational results on different classes of benchmark instances illustrate that the newly proposed exact algorithm solves several open SPDVRP instances and significantly improves the running times of state-of-the-art algorithms.
報告人簡介：
李紀(jì)柳，博士，西北工業(yè)大學(xué)教授、博士生導(dǎo)師，課題組主要研究方向分為智慧物流、智能生產(chǎn)，從事網(wǎng)絡(luò)規(guī)劃、運(yùn)輸調(diào)度、生產(chǎn)調(diào)度、設(shè)施選址等重要問題的研究，擅長通過數(shù)學(xué)規(guī)劃理論、優(yōu)化算法等解決確定性或隨機(jī)性的優(yōu)化問題，具有豐富的科研技巧及企業(yè)落地經(jīng)驗(yàn)。近五年在國際頂級和重要期刊發(fā)表了多篇學(xué)術(shù)論文，包括INFORMS Journal on Computing (UTD 24)、Transportation Science、Transportation Research Part B/E、Omega等。
