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

p-鲁棒枢纽定位问题的松弛分解算法

A Relax-and-Decomposition Algorithm for a p-Robust Hub Location Problem

Saeid Abbasi Parizi, Mahdi Bashiri, Andrew Eberhard

摘要:

本文将一个非线性p-鲁棒枢纽定位问题推广到风险环境中,其中采用了带有最小-最大遗憾形式的增广机会约束,将网络风险作为目标之一.该模型考虑了安全、空气污染和拥堵等风险因素,以设计鲁棒的枢纽网络。一个基于蒙特卡罗模拟的算法,即,一个样本平均近似方案被应用到选择一组有效的方案。然后,使用一种新的松弛和分解启发式的基础上耦合的加速Benders分解与拉格朗日松弛法的问题得到解决。为了改善分解机制,多帕累托切割版本中所提出的算法。在我们的数值试验中,修改了著名的CAB数据集,使用不同程度的参数不确定性。结果表明,所提出的模型设计一个强大的网络的能力。我们还验证了样本平均近似方法的准确性。最后,将该算法在不同情况下的求解结果与其他求解方法进行了比较,验证了该算法的有效性。

英文摘要:

In this paper, a non-linear p-robust hub location problem is extended to a risky environment where augmented chance constraint with a min-max regret form is employed to consider network risk as one of the objectives. The model considers risk factors such as security, air pollution and congestion to design the robust hub network. A Monte-Carlo simulation based algorithm, namely, a sample average approximation scheme is applied to select a set of efficient scenarios. The problem is then solved using a novel relax-and-decomposition heuristic based on the coupling of an accelerated Benders decomposition with a Lagrangian relaxation method. To improve the decomposition mechanism, a multi-Pareto cut version is applied in the proposed algorithm. In our numerical tests a modification of the well-known CAB data set is used with different levels of parameters uncertainty. The results demonstrate the capability of the proposed model to design a robust network. We also verify the accuracy of the sample average approximation method. Finally, the results of the proposed algorithm for different instances were compared to other solution approaches which confirm the efficiency of the proposed solution method.

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

↑