arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0606040cs.DScs.CC
收藏

多准则TSP问题的近似算法

Approximation Algorithms for Multi-Criteria Traveling Salesman Problems

Bodo Manthey, L. Shankar Ram

摘要:

在多目标优化问题中,需要对多个目标函数进行优化。由于不同的目标函数通常是相互冲突的,人们不能只考虑一个特定的解决方案作为最佳解决方案。相反,其目的是计算所谓的帕累托曲线的解决方案。由于帕累托曲线通常不能有效地计算,我们必须满足于近似它们。我们设计了一个多准则g-度量STSP的确定性多项式时间算法,该算法计算所有1/2<=g<=1的(min{1 +g,2g^2/(2g^2 - 2g +1)} + eps)-近似Pareto曲线。特别是,我们得到了(2+eps)-近似的多标准度量STSP。我们还提出了两个随机近似算法的多准则g-度量STSP,实现的近似比分别为(2g^3 + 2g^2)/(3g^2 - 2g +1)+ eps和(1 +g)/(1 + 3g-4g^2)+ eps。此外,我们提出了多准则g-度量ATSP(ratio 1/2 + g^3/(1 - 3g^2)+ eps)(g < 1/sqrt(3))、权重为1和2的STSP(ratio 4/3)和权重为1和2的ATSP(ratio 3/2)的随机近似算法。为了做到这一点,我们设计了多标准的循环覆盖和图形因子问题的随机逼近方案。

英文摘要:

In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be content with approximations to them. We design a deterministic polynomial-time algorithm for multi-criteria g-metric STSP that computes (min{1 +g, 2g^2/(2g^2 -2g +1)} + eps)-approximate Pareto curves for all 1/2<=g<=1. In particular, we obtain a (2+eps)-approximation for multi-criteria metric STSP. We also present two randomized approximation algorithms for multi-criteria g-metric STSP that achieve approximation ratios of (2g^3 +2g^2)/(3g^2 -2g +1) + eps and (1 +g)/(1 +3g -4g^2) + eps, respectively. Moreover, we present randomized approximation algorithms for multi-criteria g-metric ATSP (ratio 1/2 + g^3/(1 -3g^2) + eps) for g < 1/sqrt(3)), STSP with weights 1 and 2 (ratio 4/3) and ATSP with weights 1 and 2 (ratio 3/2). To do this, we design randomized approximation schemes for multi-criteria cycle cover and graph factor problems.

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

↑