题目: 需求可拆分取送问题的精确算法设计

An Exact Method for the Split-demand One-commodity Pickup and Delivery Problem

演讲人: 罗志兴副教授，南京大学

时间: 2022年10月27日上午 10:00

地点: 腾讯会议

会议号：933 464 060

会议密码：198767

讲座摘要:

In this paper, we address the split-demand one-commodity pickup and delivery routing problem (SOPDP), in which any amount of product collected from a pickup customer can be supplied to any delivery customer, and the demand of each vertex may be collected or delivered multiple times by the same or distinct vehicles. We describe an exact branch-and-price-and-cut method for the SOPDP based on three-index vehicle flow and pattern-based mathematical formulations. The method relies on an ad hoc label-setting algorithm used to solve the pricing problem associated with the pattern-based formulation, where the label components embed reduced cost functions instead of components based on the vehicle load, and set-dominance rules are used to speed up the computation. Extensive computational results illustrate the performance of the approach on benchmark instances from the literature.

演讲嘉宾简介:

罗志兴副教授于2010年在华南理工大学获得学士学位，于2014年在香港城市大学获得博士学位，现为南京大学工程管理学院副教授，主要研究的领域是运筹优化算法设计、智慧物流、智能制造等。他主持国家自然科学基金青年项目、面上项目和优秀青年项目各一项，在国际知名期刊INFORMS Journal on Computing、Transportation Science、Transportation Research Part-B: Methodological以及Naval Research Logistics发表论文十多篇。他2018年参加京东物流举办的“全球运筹优化挑战赛”，在城市物流运输车辆智能调度赛题获得第一名，2020年入选中国科协青年人才托举工程。