Smoothed Analysis of the 2-Opt Algorithm for the General TSP
Matthias Englert, Heiko Röglin, Berthold Vöcking
University of Warwick University of Bonn RWTH Aachen University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
2-Opt is a simple local search heuristic for the traveling salesperson problem that performs very well in experiments with respect to both running time and solution quality. In contrast to this, there are instances on which 2-Opt may need an exponential number of steps to reach a local optimum. To understand why 2-Opt usually finds local optima quickly in experiments, we study its expected running time in the model of smoothed analysis, which can be considered as a less-pessimistic variant of worst-case analysis in which the adversarial input is subject to a small amount of random noise. In our probabilistic input model, an adversary chooses an arbitrary graph G and a probability density function for each edge according to which its length is chosen. We prove that in this model the expected number of local improvements is O (mnϕ ċ 16 √ln m )= m 1+ o (1) nϕ , where n and m denote the number of vertices and edges of G , respectively, and ϕ denotes an upper bound on the density functions.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIComplexity and Algorithms in Graphs
Metaheuristic Optimization Algorithms Research · Computational Geometry and Mesh Generation
参考文献 6
此处列出前 3 条
引用本文 29
按被引量排序,此处列出前 3 条