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

有益邻域搜索与局部下降的最小条件

Minimal Conditions for Beneficial Neighbourhood Search and Local Descent

Monash University(莫纳什大学)

Mark G. Wallace

AI总结:

本文首次给出邻域局部性与成本概率递减足以使邻域搜索优于盲目搜索的证明,并提出局部盲目下降方法,证明其在多种条件下达到目标成本所需期望步骤少于盲目搜索。

摘要:

本文研究一个邻域需要具备哪些性质才能支持有益的局部搜索。我们证明,邻域局部性以及成本概率向最优解方向降低,支持如下证明:在单个搜索步骤中,在邻居中搜索比盲目搜索更有可能找到改进解。本文是首次引入此类证明的论文。这些性质背后的概念在一个可满足性问题类以及旅行商问题上进行了说明。其次,对于给定的成本目标 t,我们研究了一种将盲目搜索与局部下降相结合的搜索方式,称为局部盲目下降,并给出了多种条件,在这些条件下,使用局部盲目下降达到优于 t 的成本所需步骤的期望值被证明小于盲目搜索。实验表明,给定目标成本 t 的局部盲目下降,应在起始成本处切换到局部下降,且该起始成本随着 t 接近最优解而降低。

英文摘要:

This paper investigates what properties a neighbourhood requires to support beneficial local search. We show that neighbourhood locality, and a reduction in cost probability towards the optimum, support a proof that search among neighbours is more likely to find an improving solution in a single search step than blind search. This is the first paper to introduce such a proof. The concepts underlying these properties are illustrated on a satisfiability problem class, and on travelling salesman problems. Secondly, for a given cost target t, we investigate a combination of blind search and local descent termed local blind descent, and present various conditions under which the expected number of steps to reach a cost better than t using local blind descent, is proven to be smaller than with blind search. Experiments indicate that local blind descent, given target cost t, should switch to local descent at a starting cost that reduces as t approaches the optimum.

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

↑