报告题目:A Branch-and-Price-and-Cut Algorithm for a Pickup and Delivery Problem in Retailing报告所属学科：管理科学与工程
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年参加京东物流举办的“全球运筹优化挑战赛”，在城市物流运输车辆智能调度赛题获得冠军。