带越库的易腐货物取送货问题
The Pickup and Delivery Problem with Crossdock for Perishable Goods
AI总结:
研究扩展了取送货问题,提出带越库的易腐货物取送货问题(PDPCDPG),考虑时间窗、车辆容量、同步及易腐货物约束,将其线性化为MILP并加入有效不等式,用Branch-and-Cut求解,实验验证了方法的稳定性和实用性。
摘要:
我们的工作从取送货问题(PDP)的原始定义出发,通过引入一个交换点(crossdock,越库)对其进行扩展,车辆可在该点与其他车辆交换货物,以缩短配送路线并减少运行时间。研究考虑了多种操作约束,如时间窗、车辆容量以及车辆在crossdock处的同步。此外,还考虑了易腐货物不宜长途运输的特殊要求。基于上述考虑,本研究引入了带越库的易腐货物取送货问题(PDPCDPG),并将其建模为非线性规划问题。随后,通过线性化技术将PDPCDPG重新表述为MILP,并加入有效不等式以收紧搜索空间,在使用Branch-and-Cut求解全局最优时应用了这些不等式。在文献中的基准实例上进行了多种计算实验以评估模型性能。结果表明所提方法具有求解稳定性。该模型旨在为处理时间敏感型配送的运输和物流公司提供实用且有效的方法。
英文摘要:
Our work departs from the original definition of the Pickup and Delivery Problem (PDP) and extends it by considering an interchange point (crossdock) where vehicles can exchange their goods with other vehicles in order to shorten their delivery routes and reduce their running times. Multiple operational constraints, such as time windows, vehicle capacities, and the synchronization of vehicles at the crossdock, are considered. In addition, the specific requirements of perishable goods, which should not be carried on long trips, are taken into account. Given this consideration, this study introduces the Pickup and Delivery Problem with Crossdock for Perishable Goods (PDPCDPG) and models it as a nonlinear programming problem. PDPCDPG is then reformulated to a MILP with the use of linearizations and its search space is tightened with the addition of valid inequalities that are employed when solving the problem to global optimality with Branch-and-Cut. Various computational experiments are conducted on benchmark instances found in the literature to assess the performance of our model. The results demonstrate the solution stability of the proposed approach. The proposed model aims to provide a practical and effective approach for transportation and logistics companies dealing with time-sensitive deliveries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。