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

一种鲁棒优化方法用于流分解

A robust optimization approach to flow decomposition

Aalto University(阿尔托大学);RPTU Kaiserslautern-Landau(凯泽斯劳滕-兰道技术大学);Technical University of Denmark(丹麦技术大学)

Moritz Stinzendörfer, Philine Schiewe, Fabricio Oliveira

AI总结:

本文将最小流分解问题推广到具有不确定边容量的情形,并从鲁棒优化的角度进行处理,提出了多项式时间可解的不同变体,并引入鲁棒流分解概念,通过可调鲁棒问题公式展示其优势。

摘要:

在本文中,我们将最小流分解问题(MFD)推广到包含不确定边容量,并从鲁棒优化的角度处理它。在经典的流分解问题中,网络流被分解为一组从固定源节点到固定汇节点的加权路径,这些路径精确表示所有边上的流分布。MFD问题渗透到多个重要应用中,包括从重建基因组序列到表示配送网络中货物或乘客的流动。受这些应用的启发,我们将MFD推广到具有有界流值的不精确情况,提供详细分析,并探索不同可在多项式时间内求解的变体。此外,我们通过引入不确定边界并应用不同的鲁棒性概念来处理不确定性,引入了鲁棒流分解的概念。最后,我们提出了两种不同的可调鲁棒问题公式,并进行了计算实验,展示了可调性的好处。

英文摘要:

In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is decomposed into a set of weighted paths from a fixed source node to a fixed sink node that precisely represents the flow distribution across all edges. MFD problems permeate multiple important applications, including reconstructing genomic sequences to representing the flow of goods or passengers in distribution networks. Inspired by these applications, we generalize the MFD to an inexact case with bounded flow values, provide a detailed analysis, and explore different variants that are solvable in polynomial time. Moreover, we introduce the concept of robust flow decomposition by incorporating uncertain bounds and applying different robustness concepts to handle the uncertainty. Finally, we present two different adjustably robust problem formulations and perform computational experiments illustrating the benefit of adjustability.

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

↑