arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.08261cs.NEcs.PL
收藏

局部搜索邻域算子自动综合研究报告

Research Report on Automatic Synthesis of Local Search Neighborhood Operators

Mateusz Ślażyński

摘要:

约束规划(CP)和局部搜索(LS)是处理组合搜索和优化问题的不同范例。它们的互补功能促使研究人员创建混合CP/LS解决方案,同时保持CP的建模能力和基于几何的LS方法的计算优势。本报告中提出的研究重点是开发一种新的方法来推断一个有效的LS邻域算子的基础上的问题结构,在CP范式建模。我们考虑一个有限的形式语言,我们称之为一个邻域定义语言,用于指定在一个细粒度的和声明的方式邻域运算符。与称为Noodle的逻辑编程运行时一起,它允许使用语法进化算法自动合成复杂的运算符。

英文摘要:

Constraint Programming (CP) and Local Search (LS) are different paradigms for dealing with combinatorial search and optimization problems. Their complementary features motivated researchers to create hybrid CP/LS solutions, maintaining both the modeling capabilities of CP and the computational advantages of the heuristic-based LS approach. Research presented in this report is focused on developing a novel method to infer an efficient LS neighborhood operator based on the problem structure, as modeled in the CP paradigm. We consider a limited formal language that we call a Neighborhood Definition Language, used to specify the neighborhood operators in a fine-grained and declarative manner. Together with Logic Programming runtime called Noodle, it allows to automatically synthesize complex operators using a Grammar Evolution algorithm.

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

↑