带约束时间窗的旅行修理工问题的加速比
Speedup in the Traveling Repairman Problem with Constrained Time Windows
摘要:
针对无根移动修理工问题,提出了一种双准则近似算法,以提高修理工的运动速度换取利润的增加。该算法将以前的结果从所有时间窗口长度相同的情况推广到它们的长度可以在l和2之间的情况。这种分析可以扩展到任何时间窗口长度范围,遵循我们早期的技术。修理工利润和加速率之间的这种关系适用于一系列值,这些值取决于将输入以特别理想的形式投入的成本,包括所谓的“修剪窗口”。“对于长度在1和2之间的时间窗口,我们的分析适用的加速$s$的值范围是$1 \leq s \leq 6$。在这个范围内,我们建立了一个近似比,该近似比对于$s$的任何特定值都是恒定的。
英文摘要:
A bicriteria approximation algorithm is presented for the unrooted traveling repairman problem, realizing increased profit in return for increased speedup of repairman motion. The algorithm generalizes previous results from the case in which all time windows are the same length to the case in which their lengths can range between l and 2. This analysis can extend to any range of time window lengths, following our earlier techniques. This relationship between repairman profit and speedup is applicable over a range of values that is dependent on the cost of putting the input in an especially desirable form, involving what are called "trimmed windows." For time windows with lengths between 1 and 2, the range of values for speedup $s$ for which our analysis holds is $1 \leq s \leq 6$. In this range, we establish an approximation ratio that is constant for any specific value of $s$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。