arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.02731math.OCmath.CO
收藏

离散成本多商品网络设计问题的新拉格朗日松弛法

New Lagrangian Relaxation Approach for the Discrete Cost Multicommodity Network Design Problem

Nesrine Bakkar Ennaifer, Safa Bhar Layeb, Farah Mansour Zeghal

摘要:

我们的目标是获得有效的下界的离散成本多商品网络设计问题(DCMNDP)。给定一个无向图,该问题要求在每条边上最多安装一个设施,使得一组点对点的商品流可以被路由并且成本最小化。在文献中,拉格朗日松弛通常被应用到基于弧的制定,以获得下界。在这项工作中,我们研究了一个基于路径的配方,我们解决了它的拉格朗日松弛使用几个不可微的优化技术。更准确地说,我们设计了六个变种的偏转次梯度程序,使用各种方向搜索和步长策略。这些拉格朗日为基础的方法的计算性能进行评估和比较一组随机生成的实例,和现实世界的问题。

英文摘要:

We aim to derive effective lower bounds for the Discrete Cost Multicommodity Network Design Problem (DCMNDP). Given an undirected graph, the problem requires installing at most one facility on each edge such that a set of point-to-point commodity flows can be routed and costs are minimized. In the literature, the Lagrangian relaxation is usually applied to an arc-based formulation to derive lower bounds. In this work, we investigate a path-based formulation and we solve its Lagrangian relaxation using several non-differentiable optimization techniques. More precisely, we devised six variants of the deflected subgradient procedures, using various direction-search and step-length strategies. The computational performance of these Lagrangian-based approaches are evaluated and compared on a set of randomly generated instances, and real-world problems.

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

↑