報告題目:A Branch-and-Price-and-Cut Algorithm for a Pickup and Delivery Problem in Retailing

報告所屬學科：管理科學與工程
報告人：羅志興 （南京大學）
報告時間：2019年6月28日9:00
報告地點：將軍路校區經管樓706
報告摘要：
The Production Routing Problem (PRP) arises in the applications of integrated supply chain which jointly optimizes the production, inventory, distribution, and routing decisions. The literature on this problem is quite rare due to its complexity. In this paper, we consider the multi-vehicle PRP (MVPRP) with Order-Upto level inventory replenishment policy where, every time a customer is visited, the quantity delivered is such that the maximum inventory level is reached. We propose an exact Benders’ decomposition approach to solve the MVPRP, which decomposes the problem as a master problem and a slave problem. The master problem decides whether to produce the product, the quantity to be produced, and the customers to be replenished for every period of the planning horizon. The resulting slave problem decomposes into a Capacitated Vehicle Routing Problem for each period of the planning horizon where each problem is solved using an exact algorithm based on the set partitioning model, and the identified feasibility and optimality cuts are added to the master problem to guide the solution process. Valid inequalities and initial optimality cuts are used to strengthen the LP-relaxation of the master formulation. The exact method is tested on MVPRP instances and on instances of the multi-vehicle Vendor-Managed Inventory Routing Problem, a special case of the MVPRP, and the good performance of the proposed approach is demonstrated.
Besides the above research work, Prof. Luo will also share the interesting topic in JD optimization challenge and the recent developments in vehicle routing problems.
報告人簡介：
羅志興老師于2010年在華南理工大學獲得學士學位，于2014年在香港城市大學獲得博士學位，現為南京大學工程管理學院副教授，主要研究的領域是運籌優化算法設計、智慧物流、智能制造等。他主持國家自然科學基金青年項目一項，發表國際知名期刊論文15篇，多篇論文發表在運籌優化或交通運輸領域頂級期刊INFORMS Journal on Computing、Transportation Science以及Transportation Research Part-B: Methodological。2018年參加京東物流舉辦的“全球運籌優化挑戰賽”，在城市物流運輸車輛智能調度賽題獲得冠軍。