arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.08549math.OC
收藏

随机需求车辆路径问题的新精确算法及其解的性质

New Exact Algorithm and Solution Properties for the Vehicle Routing Problem with Stochastic Demands

Alexandre Florio, Richard Hartl, Stefan Minner

摘要:

研究了最优补货条件下随机需求车辆路径问题。我们开发了一个精确的算法,是有效的解决实例与许多车辆和很少的客户每路线。在我们的实验中,我们表明,在这些情况下,解决随机问题是最相关的(即,确定性等价解上的潜在增益最高)。建议的分支价格和削减算法依赖于一个有效的标签程序,精确和启发式的优势规则,并完成边界价格有利可图的列。最多可在小于5小时内解决76个节点的问题,最多可在算法的长期运行中解决148个节点的问题。这些实验也让我们在这个问题上有了新的发现。解决随机问题导致解决方案优于确定性等效解决方案高达10%。当路径数不固定时,迂回到仓库和最优补货下的最优解几乎等价。开辟新航线是降低补货成本的好策略,在许多情况下,可以降低运输成本。第一次,在路线的预期需求被允许超过车辆的能力的情况下,也进行了测试,结果表明,具有较低的成本和更少的路线存在优越的解决方案。

英文摘要:

This paper considers the vehicle routing problem with stochastic demands (VRPSD) under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our experiments, we show that in these instances solving the stochastic problem is most relevant (i.e., the potential gains over the deterministic equivalent solution are highest). The proposed branch-price-and-cut algorithm relies on an efficient labeling procedure, exact and heuristic dominance rules, and completion bounds to price profitable columns. Instances with up to 76 nodes could be solved in less than 5 hours, and instances with up to 148 nodes could be solved in long-runs of the algorithm. The experiments also allowed new findings on the problem. Solving the stochastic problem leads to solutions up to 10% superior to the deterministic equivalent solution. When the number of routes is not fixed, the optimal solutions under detour-to-depot and optimal restocking are nearly equivalent. Opening new routes is a good strategy to reduce restocking costs, and in many cases results in solutions with less transportation costs. For the first time, scenarios where the expected demand in a route is allowed to exceed the capacity of the vehicle were also tested, and the results indicate that superior solutions with lower cost and fewer routes exist.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑