具有随机需求的车辆路径问题——通用的非聚合整数L形 formulations
On vehicle routing problems with stochastic demands -- Generic disaggregated integer L-shaped formulations
AI总结:
本文研究了具有随机需求的车辆路径问题,提出了一种基于场景分布的算法,通过统一框架扩展了整数L形 formulations,首次将部分路径和集合切割结合,提升计算效率。
摘要:
我们研究了具有随机需求的车辆路径问题(VRPSD),这是经典容量车辆路径问题的重要变种,其中客户需求被建模为随机变量。我们开发了首个算法,用于需求由场景经验概率分布给出的情况——一种数据驱动的变种,解决了文献中识别出的重大挑战:处理相关性。事实上,大多数先前的精确算法依赖于随机变量的独立性。为了解决场景下的VRPSD问题,我们引入了一个统一的框架,该框架扩展了为其他变种问题开发的现有整数L形(ILS) formulations。此框架及后续分析使我们能够扩展先前的ILS切割,并确定应用这些扩展所需的前提条件。特别是,我们的结果使首次将两种先前类型的不等式:部分路径和集合切割结合,从而带来显著的计算改进。
英文摘要:
We study the vehicle routing problem with stochastic demands (VRPSD), an important variant of the classical capacitated vehicle routing problem in which customer demands are modeled as random variables. We develop the first algorithm for the VRPSD in the case where the demands are given by an empirical probability distribution of scenarios -- a data-driven variant that tackles a significant challenge identified in the literature: dealing with correlations. Indeed, most previous exact algorithms for this problem relied on independence of the random variables. To address the VRPSD with scenarios, we introduce a unifying framework that generalizes existing integer L-shaped (ILS) formulations developed for other variants of the problem. This framework and subsequent analysis allow us to generalize previous ILS cuts and pinpoint which assumptions are needed to apply those generalizations. In particular, our results enable, for the first time, the combination of two previous types of inequalities: partial route and set cuts, which leads to significant computational improvements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。