求解k-标号生成森林问题的智能VNS启发式算法
Towards an intelligent VNS heuristic for the k-labelled spanning forest problem
摘要:
在目前正在进行的项目中,我们研究了一种新的可能性,解决k标记的生成森林(kLSF)问题的智能可变邻域搜索(Int-VNS)元启发式。在kLSF问题中,我们给定一个无向输入图G和一个整数正值k,目标是找到G的一个生成森林,该森林具有最小的连通分量数和要使用的标签数的上界k。该问题与最小标记生成树(MLST)问题有关,其目标是获得具有最少标签数量的输入图的生成树,并且在现实世界中有几个应用,其中一个旨在通过同构连接来确保连通性。我们为kLSF问题提出的Int-VNS元启发式算法来自最近为MLST问题提出的有前途的智能VNS策略,并将kLSF问题的基本VNS与来自机器学习,统计和实验算法的其他补充方法相结合,以产生高质量的性能并完全自动化所产生的策略。
英文摘要:
In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS) metaheuristic. In the kLSF problem we are given an undirected input graph G and an integer positive value k, and the aim is to find a spanning forest of G having the minimum number of connected components and the upper bound k on the number of labels to use. The problem is related to the minimum labelling spanning tree (MLST) problem, whose goal is to get the spanning tree of the input graph with the minimum number of labels, and has several applications in the real world, where one aims to ensure connectivity by means of homogeneous connections. The Int-VNS metaheuristic that we propose for the kLSF problem is derived from the promising intelligent VNS strategy recently proposed for the MLST problem, and integrates the basic VNS for the kLSF problem with other complementary approaches from machine learning, statistics and experimental algorithmics, in order to produce high-quality performance and to completely automate the resulting strategy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。