arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.7282cond-mat.stat-mechcs.AIphysics.data-an
收藏

应用于旅行商问题的交互副本方法

An interacting replica approach applied to the traveling salesman problem

Washington University in St. Louis(圣路易斯华盛顿大学)

Bo Sun, Blake Leonard, Peter Ronhovde, Zohar Nussinov

摘要:

提出了一种求解组合优化问题的物理启发式方法。我们的方法是特别的动机,以避免陷入亚稳态局部极小值的愿望-一个常见的硬问题与多个极值。我们的方法涉及(i)通过几何距离耦合系统(“副本”)的其他独立模拟,以及(ii)应用于单个副本找到的解决方案的概率推理。副本的{ \it系综}演变为最大化副本间相关性,同时最小化局部副本内成本函数(例如,每个副本内的旅行商问题中的总路径长度)。我们演示了我们的方法如何提高性能的基本局部优化计划长期应用于NP难旅行推销员问题。特别是,我们将我们的方法应用于著名的“$k$ -opt”算法,并检查两个特定的情况下- $k=2$和$k=3$。仅借助几何耦合,我们就能够确定最大到$280$城市的系统的最佳行程长度(比通常由裸$k=3$ opt解决的最大系统大一个数量级)。基于概率复制的推理方法进一步改进了$k-opt$,并确定了具有$318$城市的问题的最优解,并找到了其总长度接近于具有更多城市的其他系统的最优解的总长度的旅行。

英文摘要:

We present a physics inspired heuristic method for solving combinatorial optimization problems. Our approach is specifically motivated by the desire to avoid trapping in metastable local minima- a common occurrence in hard problems with multiple extrema. Our method involves (i) coupling otherwise independent simulations of a system ("replicas") via geometrical distances as well as (ii) probabilistic inference applied to the solutions found by individual replicas. The {\it ensemble} of replicas evolves as to maximize the inter-replica correlation while simultaneously minimize the local intra-replica cost function (e.g., the total path length in the Traveling Salesman Problem within each replica). We demonstrate how our method improves the performance of rudimentary local optimization schemes long applied to the NP hard Traveling Salesman Problem. In particular, we apply our method to the well-known "$k$-opt" algorithm and examine two particular cases- $k=2$ and $k=3$. With the aid of geometrical coupling alone, we are able to determine for the optimum tour length on systems up to $280$ cities (an order of magnitude larger than the largest systems typically solved by the bare $k=3$ opt). The probabilistic replica-based inference approach improves $k-opt$ even further and determines the optimal solution of a problem with $318$ cities and find tours whose total length is close to that of the optimal solutions for other systems with a larger number of cities.

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

↑