参数城市中对称线规划的价格
The Price of Symmetric Line Plans in the Parametric City
摘要:
我们认为,在参数城市,一个理想化的模型,捕捉典型的情况下,(小)数量的参数的公共交通线路规划问题。参数城市是旋转对称的,但最优线路规划并不总是对称的。这就提出了量化最佳对称解和总体最佳解之间的对称性差距的问题。对于我们的分析,我们制定的线路规划问题作为一个混合整数线性规划,可以在多项式时间内解决,如果解决方案是对称的。当特定的参数城市参数固定时,对称间隙可以证明是很小的,并且我们给出了这种情况下参数城市线路规划的近似算法。虽然对称间隙可以任意大的一般情况下,我们表明,对称线计划是一个很好的选择,在大多数实际情况下。
英文摘要:
We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametric City is rotation symmetric, but optimal line plans are not always symmetric. This raises the question to quantify the symmetry gap between the best symmetric and the overall best solution. For our analysis, we formulate the line planning problem as a mixed integer linear program, that can be solved in polynomial time if the solutions are forced to be symmetric. The symmetry gap is provably small when a specific Parametric City parameter is fixed, and we give an approximation algorithm for line planning in the Parametric City in this case. While the symmetry gap can be arbitrarily large in general, we show that symmetric line plans are a good choice in most practical situations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。